par Devillers, Raymond 
Référence Lecture notes in computer science, 1119, page (465-480)
Publication Publié, 1996
Référence Lecture notes in computer science, 1119, page (465-480)
Publication Publié, 1996
Article révisé par les pairs
| Résumé : | The paper shows that even the infinite nets arising from the application of the (non-guarded as well as guarded) recursion operator in the Petri Box Calculus exhibit the ”finite precedence” property, i.e. each event in a process only has finitely many predecessor events, and each ”complete” process only has finitely many events. The techniques used in the paper extensively exploit the labelled tree device introduced in the definition of the general recursion operator, the general properties of the latter, and the S-invariant analysis results obtained in a previous paper. |
