Operational semantics for Petri net components
From MaRDI portal
Publication:2373704
Recommendations
Cites work
- A compositional partial order semantics for Petri net components
- A uniform approach to true-concurrency and interleaving semantics for Petri nets
- Algebraic laws for nondeterminism and concurrency
- Branching bisimilarity is an equivalence indeed!
- Branching time and abstraction in bisimulation semantics
- Coloured Petri nets. Basic concepts, analysis methods and practical use. Vol. 1
- Compositional modeling of reactive systems using open nets
- ESTL: A Temporal Logic for Events and States
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 606833 (Why is no real title available?)
- Operational and denotational semantics for the box algebra
- Process Algebra
- Reset nets between decidability and undecidability
- Rooted branching bisimulation as a congruence
- Structured operational semantics and bisimulation as a congruence
- Three logics for branching bisimulation
Cited in
(4)
This page was built for publication: Operational semantics for Petri net components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373704)