Petri nets and bisimulation

DOI10.1016/0304-3975(95)00122-0zbMath0872.68129OpenAlexW2075412006MaRDI QIDQ672873

Glynn Winskel, Mogens Nielsen

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00122-0

zbMATH Keywords

Petri netsbisimulationconcurrencyasynchronous transition systems

Mathematics Subject Classification ID

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

Related Items

Petri nets, algebras, morphisms, and compositionality, Semantic domains of timed event structures, Property-preserving transformations of elementary net systems based on morphisms, The homology of partial monoid actions and Petri nets, Presheaf models for CCS-like languages, Undecidability of domino games and hhp-bisimilarity., Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm, On the expressiveness of higher dimensional automata, New Bisimulation Semantics for Distributed Systems, Synchronization expressions with extended join operation, Towards a unified view of bisimulation: A comparative study

Cites Work

• Linear logic
• Modeling concurrency with partial orders
• Petri nets, algebras, morphisms, and compositionality
• Petri nets, event structures and domains. I
• Elementary transition systems
• A completeness theorem for open maps
• Bisimulation of automata
• Bisimulation from open maps
• Concurrent Machines
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item