Paper Info
Title
General Refinement and Recursion Operators for the Petri Box Calculus
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.
Year
DOI
Venue
1993
10.1007/3-540-56503-5_16
STACS
Keywords
Field
DocType
recursion operators,petri box calculus,general refinement,partial order
Petri box calculus,Discrete mathematics,Combinatorics,Computer science,Corecursion,Operator (computer programming),Mutual recursion,Fixed point,Double recursion,Left recursion,Recursion
Conference
ISBN
Citations 
PageRank 
3-540-56503-5
35
2.10
References 
Authors
5
3
Name
Order
Citations
PageRank
Eike Best127456.26
Raymond Devillers274276.40
Javier Esparza351339.11