Maximality preserving bisimulation

DOI10.1016/0304-3975(92)90298-TzbMath0780.68036MaRDI QIDQ1193655

Raymond Devillers

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

bisimulationlabelled \(P/T\) netsspecification of concurrent systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Concurrent bisimulations in Petri nets, Deciding true concurrency equivalences on safe, finite nets, A reduced maximality labeled transition system generation for recursive Petri nets, Deciding true concurrency equivalences on finite safe nets (preliminary report), \(\tau\)-bisimulations and full abstraction for refinement of actions, Bisimulation and action refinement, New Bisimulation Semantics for Distributed Systems, 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