Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation 2020
DOI: 10.1145/3372884.3373161
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic bisimulation for open and parameterized systems

Abstract: Open Automata (OA) are symbolic and parameterized models for open concurrent systems. Here open means partially specified systems, that can be instantiated or assembled to build bigger systems. An important property for such systems is "compositionality", meaning that logical properties, and equivalences, can be checked locally, and will be preserved by composition. In previous work, a notion of equivalence named FH-Bisimulation was defined for open automata, and proved to be a congruence for their composition… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…Indeed, while the schema of the proof of transitivity was not directly applicable on the definition of weak bisimulation, Lemma 5 provides a characterisation of weak bisimulation similar to the definition of strong bisimulation, and thus the same proof scheme is directly applicable. ; suppose 11 : 11 Note that the hypotheses of the lemma imply that Q is not a pLTS but a similar lemma can be proven for a pLTS Q…”
Section: Lemma 5 (Alternative Definition Of Weak Bisimulation) the De...mentioning
confidence: 81%
See 3 more Smart Citations
“…Indeed, while the schema of the proof of transitivity was not directly applicable on the definition of weak bisimulation, Lemma 5 provides a characterisation of weak bisimulation similar to the definition of strong bisimulation, and thus the same proof scheme is directly applicable. ; suppose 11 : 11 Note that the hypotheses of the lemma imply that Q is not a pLTS but a similar lemma can be proven for a pLTS Q…”
Section: Lemma 5 (Alternative Definition Of Weak Bisimulation) the De...mentioning
confidence: 81%
“…We also plan to apply open pNets to the study of complex composition operators in a symbolic way, for example in the area of parallel skeletons, or distributed algorithms. We have developed tool support for computing the symbolic semantics in term of open-automata [12], and have developed algorithms to check strong FH-bisimulation [11]. Naturally we are now working toward an implementation of weak FH-Bisimulation.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Previous works on OA focused on equivalence relations compatible with composition. In [18], a computable bisimulation is introduced, while in [6] a weak version of the bisimulation is introduced. In this paper we tackle the refinement relation in the form of simulation, as is the case for the corresponding relations on labelled transition systems [8].…”
Section: Related Workmentioning
confidence: 99%