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
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
Combining CCS and Petri nets via structural axioms
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
Operational and denotational semantics for the box algebra
Theoretical Computer Science
Distributed and parallel systems
Petri net algebra
Communication and Concurrency
Specification and Analysis of Concurrent Systems: The COSY Approach
Specification and Analysis of Concurrent Systems: The COSY Approach
Asynchronous Links in the PBC and M-Nets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
B(PN)2 - a Basic Petri Net Programming Notation
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
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
Petri Net Semantics of the Finite π-calculus Terms
Fundamenta Informaticae
Hi-index | 0.00 |
IThe starting point of this paper is an algebraic Petri net framework allowing one to express net compositions, such as iteration and parallel composition, as well as transition synchronisation and restriction. We enrich the original model by introducing new constructs supporting asynchronous interprocess communication. Such a communication is made possible thanks to special 'buffer' places where different transitions (processes) may deposit and remove tokens. We also provide an abstraction mechanism, which hides buffer places, effectively making them private to the processes communicating through them. We then provide an algebra of process expressions, whose constants and operators directly correspond to those used in the Petri net framework. Such a correspondence is used to associate nets to process expressions in a compositional way. That the resulting algebra of expressions is consistent with the net algebra is demonstrated by showing that an expression and the corresponding net generate isomorphic transition systems. This results in the Asynchronous Box Calculus (or ABC), which is a coherent dual model, based on Petri nets and process expressions, suitable for modelling and analysing distributed systems whose components can interact using both synchronous and asynchronous communication.