par Devillers, Raymond 
Référence Acta informatica, 32, 4, page (313-345)
Publication Publié, 1995-04
Référence Acta informatica, 32, 4, page (313-345)
Publication Publié, 1995-04
Article révisé par les pairs
| Résumé : | The paper shows how to synthesise S-invariants and S-components for Petri Boxes constructed through general recursions, from S-invariants/S-components of their constituents. The construction is based on the tree-structure of the interface places used to define this operator and extends similar results obtained for the refinement operator. Emphasis is put on deriving coverability results; these results are then used to show that all the nets obtained through refinements and recursions from a family covered by S-components are self-concurrency free, at most 2-safe and exhibit a generalised emptiness property; in particular, this is the case for the nets obtained in the translation of the process algebra of Box expressions. © 1995 Springer-Verlag. |
