 | Michal P. Chytil, Ladislav Janiga, Vaclav Koubek - Computers - 1988 - 582 pages
...interested reader should consult [10]. 2 Definitions A Petri Net (PN, for short) is a tuple (P,T,<p,po), where P is a finite set of places, T is a finite set of transitions, if is a. flow function <f : (PXT) U (TXP) — » N, and fio is the initial marking (io '• P — >... | |
 | Albert R. Meyer, Michael A. Taitslin - Computers - 1989 - 310 pages
...for representation of concurrent processes with synchronization. A Petrl net is a tuple (P,T,F,M, ), where P is a finite set of places , T is a finite set of transitions, FSPxTUTxp is an incidence relation, Mo :P-> N is the initial marking, where N is the set of natural... | |
 | Wolfgang A. Halang, Krzysztof M. Sacha - Technology & Engineering - 1992 - 388 pages
...represent the set of natural numbers. Definition 3 A Petri net is a quadruple PN = (P,T,Pre, Post), where: - P is a finite set of places; - T is a finite set of transitions, such that P n T = 0; - Pre : P x T • — > N is a pre-incidence function; - Post : T x P — » A/"... | |
 | Imre Simon - Computers - 1992 - 564 pages
...and open problems. 2 Basic definitions and notation A Petri net is a 4-tuple P —< P, T, A, MO >, where P is a finite set of places; T is a finite set of transitions; A is a finite set of ores, AC (P x T) U (T x P); and M0 : P -» N, N the set of natural numbers, is... | |
 | S. Balemi, P. Kozák, Rein Smedinga - Science - 1993 - 246 pages
...In general, the PN model of the process flow in an FMS is represented by a fivetuple (P,T,I,O,Mo), where P is a finite set of places, T is a finite set of transitions, / CP x T is a set of transition input arcs, OCT x P is a set of transition output arcs, and A/0 : P... | |
 | Ernst Mayr - Computers - 1993 - 364 pages
...9], and quote the main results from [1]. 2.1 Petri nets A Petri net is a 4-tuple P =< P,T,A,M 0 >, where P is a finite set of places; T is a finite set of transitions; A is a finite set of arcs, A C (P x T) U (T x P); and MO : P —> .V, Af the set of natural numbers,... | |
 | Marco Ajmone Marsan - Mathematics - 1993 - 612 pages
...Structural Deadlocks in Ordinary Petri Nets Definition 2.1 A Petri net N is a 4-tuple <P, T, W~, W+> where P is a finite set of places, T is a finite set of transitions, W' (resp. W+) : P x T -> N is the input (resp. output) function. We also define the input set and output... | |
 | J. Dassow - Mathematics - 1994 - 290 pages
...inclusion given by Theorem 4.1. 5. Applications to Petri nets A Petri net is a tuple N = (P,T,F,B) where P is a finite set of places, T is a finite set of transitions, F and B are P xT-matrices over N, the forward and backward incidence matrices. We also view F and B... | |
 | Ulrich Rembold - Computers - 1995 - 746 pages
...to either active task it belongs to. The basic structure of Petri nets is a tuple N = (P, T, F, Mo), where P is a finite set of places. T is a finite set of transitions and F is the flow relation given by FC (P x T) U (T x P). M0 is the inital marking of N. For (p,t) € F... | |
 | Giorgio DeMichelis, Michel Diaz - Computers - 1995 - 534 pages
...behaviour neglecting time. Definition 1. A Petri net is a five tuple PN = (P,T, /+,/", M 0 ) such that P is a finite set of places, T is a finite set of transitions with P f"l T = 0, I~ and 7 + are the backward and forward incidence functions defined on P x T —>... | |
| |
P is a finite set of places, - T is a finite set of transitions (P n T = 0), - FC (P x T) U (T x P) is a set of arcs (flow relation) A... 
