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
An exercise in concurrency: a CSP process as a condition/event system
Advances in Petri Nets 1988
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
SCONE: a simple calculus of nets
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A hierarchy of system descriptions via atomic linear refinement
Fundamenta Informaticae
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
The box algebra = Petri nets + process expressions
Information and Computation
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
On Representing CCS Programs by Finite Petri Nets
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
A Distributed, Net Oriented Semantics for Delta Prolog
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Distributed Conflicts in Communicating Systems
ECOOP '94 Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems
| Hi-index | 0.00 |
A 2CCS is a conservative extension of CCS, enriched with an operator of strong prefixing, enabling the modeling of atomic sequences and multi-party synchronization (realized as an atomic sequence of binary synchronizations); the classic dining philosophers problem is used to illustrate the approach. A step semantics for A 2CCS is also presented directly as a labeled transition system. A safe Petri net semantics for this language is presented, following the approach of Degano, De Nicola, Montanari and Olderog. We prove that a process p and its associated net Net(p) are interleaving bisimilar (Theorem 5.1). Moreover, to support the claim that the intended concurrency is well-represented in the net, we also prove that a process p and its associated net Net(p) are step bisimilar (Theorem 5.2).