The box algebra = Petri nets + process expressions
Information and Computation
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 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 |
This paper presents an approach to giving a formal meaning to Petri nets defined using recursive equations. It specifically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper presents a detailed investigation of the solvability of recursive equations on nets in a setting which allows an infinite number of possibly unguarded equations, each equation possibly involving infinitely many recursion variables. The main result is that by using a suitable partially ordered domain of nets, it is always possible to solve a system of equations by constructing the limit of a chain of successive approximations starting from a suitable, very simple, net.