Treffer: S-invariant analysis of general recursive Petri boxes
Title:
S-invariant analysis of general recursive Petri boxes
Authors:
Source:
Acta informatica. 32(4):313-345
Publisher Information:
Berlin: Springer, 1995.
Publication Year:
1995
Physical Description:
print, 26 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Affinement, Refinement, Afinamiento, Composante, Components, Etiquetage, Labeling, Invariant, Invariante, Méthode récursive, Recursive method, Método recursivo, Programme concurrent, Concurrent program, Programa competidor, Réseau Pétri, Petri nets, Structure arborescente, Tree structure, Estructura arborescente, Boîte Petri, Petri box, Opérateur récurrence
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. libre Bruxelles, lab. informatique théorique, 1050 Bruxelles, Belgium
ISSN:
0001-5903
Rights:
Copyright 1995 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.3598850
Database:
PASCAL Archive
Weitere Informationen
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.