New Symbolic Model and Equivalences Checking for Open Automata

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Open Automata (OA) are symbolic and parameterized models for open concurrent systems, where open means partially specified systems, which can be instantiated or assembled to build bigger systems. In previous work, a notion of equivalence named FH-Bisimulation was defined for OA, coming with both Strong and Weak flavors, where Weak means ignoring internal moves when they do not affect the external behavior. Both flavors have been proven to be congruent for the OA's composition. In this paper, we propose a new definition of (weak) OA, that is both more expressive for encoding the behavior of parameterized systems and suitable as a finite encoding of weak OA. We name this meta (weak) OA and provide two methods to check their equivalence, either explicitly building the meta-WOA, or constructing their meta open transitions on-demand. The last strategy has better termination properties.

Original languageEnglish
Title of host publication2021 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2360-2367
Number of pages8
ISBN (Electronic)9781665442077
DOIs
StatePublished - 2021
Event2021 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2021 - Melbourne, Australia
Duration: 17 Oct 202120 Oct 2021

Publication series

NameConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
ISSN (Print)1062-922X

Conference

Conference2021 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2021
Country/TerritoryAustralia
CityMelbourne
Period17/10/2120/10/21

Fingerprint

Dive into the research topics of 'New Symbolic Model and Equivalences Checking for Open Automata'. Together they form a unique fingerprint.

Cite this