Petri nets: an introduction
Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Process algebra
S-invariant analysis of general recursive Petri boxes
Acta Informatica
Operational and denotational semantics for the box algebra
Theoretical Computer Science
Communication and Concurrency
On Representing CCS Programs by Finite Petri Nets
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Solving Recursive Net Equations
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
B(PN)2 - a Basic Petri Net Programming Notation
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Operational Semantics for the Petri Box Calculus
CONCUR '94 Proceedings of the Concurrency Theory
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
A Refined View of the Box Algebra
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
Partial Order Semantics of Box Expressions
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
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)
The Box Algebra - A Model of Nets and Process Expressions
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
| Hi-index | 0.00 |
The Petri Box Calculus (PBC) consists of an algebra of box expressions, and a corresponding algebra of boxes (a class of labelled Petri nets). A compositional semantics provides a translation from box expressions to boxes. There are several alternative ways of defining an equivalence notion for boxes, the strongest one being net isomorphism. In this paper we consider slightly weaker notion of equivalence, called duplication equivalence, which still can be argued to capture a very close structural similarity of concurrent systems represented by boxes. We transfer the notion of duplication equivalence to the domain of box expressions and investigate the relationship between duplication equivalent boxes and box expressions. The main result of this investigation is a sound and complete axiomatisation of duplication equivalence for a fragment of recursion-free PBC.