Petri nets and bisimulation
DOI10.1016/0304-3975(95)00122-0zbMATH Open0872.68129OpenAlexW2075412006MaRDI QIDQ672873FDOQ672873
Authors: Mogens Nielsen, Glynn Winskel 
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
Recommendations
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)
Cites Work
- Petri nets, event structures and domains. I
- Bisimulation from open maps
- Title not available (Why is that?)
- Concurrent Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- Modeling concurrency with partial orders
- A completeness theorem for open maps
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Elementary transition systems
- Petri nets, algebras, morphisms, and compositionality
- Bisimulation of automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (29)
- The homology of partial monoid actions and Petri nets
- Title not available (Why is that?)
- Petri nets, algebras, morphisms, and compositionality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semantic domains of timed event structures
- Error-correcting Petri nets
- Synchronization expressions with extended join operation
- Undecidability of domino games and hhp-bisimilarity.
- Recursion and Petri nets
- Title not available (Why is that?)
- Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm
- Normal and sinkless Petri nets
- Property-preserving transformations of elementary net systems based on morphisms
- Presheaf models for CCS-like languages
- On the expressiveness of higher dimensional automata
- Towards a unified view of bisimulation: A comparative study
- Concurrent bisimulations in Petri nets
- Title not available (Why is that?)
- Petri nets and regular processes
- Transition systems, link graphs and Petri nets
- Title not available (Why is that?)
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Title not available (Why is that?)
- Simultaneous Petri Net Synthesis
- Elasticity and Petri Nets
- CTS systems and Petri nets
- New Bisimulation Semantics for Distributed Systems
This page was built for publication: Petri nets and bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672873)
