Conference
An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
Abstract
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 …
Authors
Hesketh M; Koutny M
Series
Lecture Notes in Computer Science
Volume
1420
Pagination
pp. 165-184
Publisher
Springer Nature
Publication Date
1998
DOI
10.1007/3-540-69108-1_10
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743