Petri nets: an introduction
Communicating sequential processes
Communicating sequential processes
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Modelling nondeterministic concurrent processes with event structures
Fundamenta Informaticae
Flow models of distributed computations: three equivalent semantics for CCS
Information and Computation
On the implementation of concurrent calculi in net calculi: two case studies
Theoretical Computer Science
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
Petri net algebra
Communication and Concurrency
Asynchronous Links in the PBC and M-Nets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An Algebraic Semantics for Hierarchical P/T Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
A Concurrent and Compositional Petri Net Semantics of Preemption
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
| Hi-index | 0.00 |
We define an algebraic framework based on non-safe Petri nets, which allows one to express operations such as iteration, parallel composition, and transition synchronisation. This leads to an algebra of process expressions, whose constants and operators directly correspond to those used in Petri nets, and so we are able to associate nets to process expressions compositionally. The semantics of composite nets is then used to guide the definition of a structured operational semantics of process expressions. The main result is that an expression and the corresponding net generate isomorphic transition systems. We finally discuss a partial order semantics of the two algebras developed in this paper.