Compositional process semantics of Petri Boxes
From MaRDI portal
Recommendations
Cites work
- A distributed operational semantics of CCS based on condition/event systems
- Branching processes of Petri nets
- Finite representations of CCS and TCSP programs by automata and Petri nets
- scientific article; zbMATH DE number 3902012 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4060688 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 512822 (Why is no real title available?)
- Modeling concurrency with partial orders
- Process Algebra
- Sequential and concurrent behaviour in Petri net theory
- The non-sequential behaviour of Petri nets
Cited in
(11)- The box algebra = Petri nets + process expressions
- An algebra of non-safe Petri boxes
- scientific article; zbMATH DE number 5506906 (Why is no real title available?)
- scientific article; zbMATH DE number 2064221 (Why is no real title available?)
- scientific article; zbMATH DE number 1501606 (Why is no real title available?)
- Communication as unification in the Petri Box Calculus
- A refined view of the box algebra
- High level expressions with their SOS semantics
- Petri boxes and finite precedence
- Improved implementations via a new structural equivalence on labeled nets
- Trapping mutual exclusion in the box calculus
This page was built for publication: Compositional process semantics of Petri Boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890051)