Abstract
New generalised definitions are given for the refinement and recursion operators in the calculus of Petri Boxes. It is shown that not only recursion, but also other operators such as sequence, choice and iteration can be viewed as based on refinement. Various structural properties of these operators can be deduced from a general property of (simultaneous) refinement. A partial order based denota-tional approach for recursion is presented, which yields a unique fixpoint even in unguarded cases. The construction is based on a judicious naming discipline for places and transitions and yields a closed form for the fixpoint.
Cite
CITATION STYLE
Best, E., Devillers, R., & Esparza, J. (1993). General refinement and recursion operators for the Petri box calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 130–140). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
