Treffer: POC net, a subclass of Petri nets, and its application to timed Petri nets
Title:
POC net, a subclass of Petri nets, and its application to timed Petri nets
Authors:
Source:
International journal of systems science. 24(3):539-552
Publisher Information:
London: Taylor & Francis, 1993.
Publication Year:
1993
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, 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, Complexité calcul, Computing complexity, Complejidad cálculo, Réseau Pétri, Petri net, Red Petri, Liveness, Partially Ordered Condition net, Système événement discret, Discrete event system, Timed Petri net
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Waseda univ., school sci. eng., dep. applied physics, Shinjuku-ku 169 Tokyo, Japan
ISSN:
0020-7721
Rights:
Copyright 1993 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.4625268
Database:
PASCAL Archive
Weitere Informationen
Liveness is one of the most important properties of the Petri net analysis. This property is concerned with a capability for firing of transitions. On the other hand, place-liveness is another notion related to liveness, which is concerned with a capability for having tokens in places. Concerning these liveness and place-liveness problems, this paper suggests a new subclass of Petri net, «POC nets», as a superclass of AC nets and DC nets. For this subclass, the equivalence between liveness and place-liveness is shown and a sufficient condition for liveness for this POC net is derived. Then the results are extended to liveness problem of timed Petri nets which have transitions with finite firing durations and the earliest firing rule.