Operational semantics for Petri net components
From MaRDI portal
Publication:2373704
DOI10.1016/j.tcs.2007.01.003zbMath1118.68082MaRDI QIDQ2373704
Jan Friso Groote, Marc Voorhoeve
Publication date: 16 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.003
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structured operational semantics and bisimulation as a congruence
- Operational and denotational semantics for the box algebra
- A uniform approach to true-concurrency and interleaving semantics for Petri nets
- Branching bisimilarity is an equivalence indeed!
- Rooted branching bisimulation as a congruence
- Algebraic laws for nondeterminism and concurrency
- Process Algebra
- Three logics for branching bisimulation
- Branching time and abstraction in bisimulation semantics