Maximality preserving bisimulation
From MaRDI portal
Publication:1193655
DOI10.1016/0304-3975(92)90298-TzbMath0780.68036MaRDI QIDQ1193655
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Bisimulation and action refinement, \(\tau\)-bisimulations and full abstraction for refinement of actions, Deciding true concurrency equivalences on safe, finite nets, Towards a unified view of bisimulation: A comparative study
Cites Work
- Bisimulation and action refinement
- Subset languages of Petri nets. I: The relationship to string languages and normal forms
- A calculus of communicating systems
- \(\tau\)-bisimulations and full abstraction for refinement of actions
- Concurrent bisimulations in Petri nets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item