Petri nets: an introduction
Communicating sequential processes
Communicating sequential processes
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Communication and concurrency
Finite representations of CCS and TCSP programs by automata and Petri nets
Finite representations of CCS and TCSP programs by automata and Petri nets
Process algebra
Modelling nondeterministic concurrent processes with event structures
Fundamenta Informaticae
S-invariant analysis of general recursive Petri boxes
Acta Informatica
Operational and denotational semantics for the box algebra
Theoretical Computer Science
Petri net algebra
Specification and Analysis of Concurrent Systems: The COSY Approach
Specification and Analysis of Concurrent Systems: The COSY Approach
On Representing CCS Programs by Finite Petri Nets
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
General Refinement and Recursion Operators for the Petri Box Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
Petri Nets, Process Algebras and Concurrent Programming Languages
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
ICATPN '98 Proceedings of the 19th 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
Recursive Nets in the Box Algebra
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Hi-index | 0.00 |
The paper outlines a Petri net as well as a structural operational semantics for an algebra of process expressions. It specifically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper proceeds in arguably the most general setting. For it allows infinite operators, and recursive definitions which can be unguarded and involve infinitely many recursion variables. The main result is that it is possible to obtain a framework where process expressions can be given two, entirely consistent, kinds of semantics, one based on Petri nets, the other on SOS rules.