Reference:

E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. In Patrice Enjalbert et al., editor, 10th Annual Symposium on Theoretical Aspects of Computer Science 1993 (10th STACS '93), number 665 in Lecture Notes in Computer Science, pages 130–140, 1993.

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 denotational 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.

Suggested BibTeX entry:

@inproceedings{BDE93,
    author = {E. Best and R. Devillers and J. Esparza},
    booktitle = {10th Annual Symposium on Theoretical Aspects of Computer Science 1993 (10th STACS '93)},
    editor = {Patrice Enjalbert et al.},
    number = {665},
    pages = {130-140},
    series = {{Lecture Notes in Computer Science}},
    title = {General Refinement and Recursion Operators for the {P}etri Box Calculus},
    year = {1993}
}