J. Esparza and M. Nielsen, "Decidability issues for Petri nets," Petri Nets Newsletter, vol. 94, pp. 5--23, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....with . a vertex for each reachable marking of the PN, and . an arc if and only if in some firing sequence of the PN. A net is called safe if no more than one token can appear in a place. Safe nets are especially widely used in many applications since they have simple verification algorithms [12] and simple semantics. A labeled PN is a PN with a labeling function which associates every transition of the net with a symbol (called label) from the alphabet . A signal transition graph (STG) is a PN whose transitions are labeled with signal transitions ( Places with one input and one output ....

J. Esparza and M. Nielsen, "Decidability issues for Petri nets," Petri Nets Newsletter, vol. 94, pp. 5--23, 1994.

....algorithms has been provided. There exist, however, some other algorithms for the verification of subclasses of Petri nets such as free choice Petri nets [6] conflict free Petri nets c fl1997 Published by Elsevier Science B. V. 9] reversible Petri nets [3,4,11,14] and marked graphs [5,6] See [7] for a recent panorama on the decidability questions in Petri nets) We add to this list cyclic Petri nets. A Petri net is said to be cyclic if and only if its initial marking is a home state marking. Cyclic Petri nets are used in the design and control of production systems and in the design and ....

Esparza J. Nielson M. "Decidability issues for Petri nets", Bulletin EATCS, 52, 1994.

....of deciding the transitive and monotone closure (under additional AC axioms) of a relation speci ed over a freely generated commutative semigroup. Note that the symmetric, monotonic and transitive closure is decided by the Gr obner basis algorithm. For decidability results for petri nets, see [18]. Preliminaries Let be a set, called a signature, with an associated arity function : 2 IN and let V be a disjoint (denumerable) set. We de ne T ( V) as the smallest set containing V and such that f(t 1 ; t n ) 2 T ( V) whenever f 2 ; n 2 (f) and t 1 ; t n 2 T ( ....

J. Esparza and M. Nielsen. Decidability issues for petri nets. J. Inform. Process. Cybernet EIK, 30(3):143-160, 1994.

....2.5) One can easily check that the RG in Fig. 2c, derived from the PN in Fig. 2b, is isomorphic to the TS (Fig. 2a) A net is called safe if no more than one token can appear in a place. Safe nets are especially widely used in many applications, since they have simple verification algorithms [25] and simple semantics. A net is called a pure net if (p, t) # F implies that (t, p) # F, i.e. for each transition t the following condition is satisfied: t. # .t = #. A net is called simple if no two transitions t 1 and t 2 have the same sets of input and output places (i.e. 4t 1 , either t 2 .t ....

# J. Esparza and M. Nielsen, "Decidability Issues for Petri Nets," Petri Nets Newsletter, vol. 94, pp. 5-23, 1994.

....analysis technique is unable to model a Turing machine then it is unable to accurately model computer hardware. Inhibitor arcs have been included in reach (Section 4. 3) but are unnecessary because 114 safe Petri nets using complementary places can model a Turing machine without inhibitor arcs [EN94] This is only true for safe Petri nets and not for nite Petri nets. Priority is another phenomenon classical Petri nets cannot model [AF73, Kos73, Pet81a] and is therefore considered a limitation. Agerwala and Flynn [AF73] also Kosaraju [Kos73] de ned a solution to the priority channel ....

J. Esparza and M. Neilson. Decidability issues for Petri nets. Petri net newsletter No. 47, 1994. pp 5-23.

....in Presburger arithmetic. We are able in practice to treat a large number of significant examples, including Petri nets with parametric initial markings. We have also shown that our method allows us to treat the binary reachability problem for a special class of Petri nets, called BPP nets [10]. The plan of this paper is as follows. In section 2 we give some preliminaries. Section 3 recalls some basic facts about Petri nets. Section 4 gives the basic rules of our decompositional method. Section 5 explains how to compile the reachability relation via a flat language into Presburger ....

....between the class of programs with Z counters and Petri nets, and more precisely, between the computation of the least fixed point of programs with Z counters and the reachability problem for Petri nets. Let us first give an informal explanation of what a Petri net is. This is inspired from [10]. A Petri net is characterized by a set of places (drawn as circles) a set of transitions (drawn as bars) and for each transition , a set of weighted inputarcs going from a subset of places ( input places ) to , and a set of weighted output arcs going from to a subset of places ....

Esparza, J. and M. Nielsen, "Decidability Issues for Petri Nets". Bulletin of the EATCS, Number 52, Feb. 1994.

....can easily check that the RG in Figure 2(c) derived from the PN in Figure 2(b) is isomorphic to the TS (Figure 2(a) A net is called safe if no more than one token can appear in a place. Safe nets are especially widely used in many applications, since they have simple verification algorithms [25] and simple semantics. A net is called a pure net if (p; t) 2 F implies that (t; p) 62 F , i.e. for each transition t the following condition is satisfied: t t = A net is called simple if no two transitions t 1 and t 2 have the same sets of input and output places (i.e. 8t 1 ; t 2 t 1 6= ....

J. Esparza and M. Nielsen. Decidability issues for Petri nets. Petri Nets Newsletter, 94:5--23, 1994.

....can easily check that the labeled RG Figure 1,c derived for the PN from Figure 1,b is isomorphic to the TS (Figure 1,a) A net is called safe if no more than one token can appear in a place. Safe nets are especially widely used in many applications, since they have simple verification algorithms [7] and simple semantics. A net is called a pure net if (p; t) 2 F implies that (t; p) 62 F , i.e. for each transition t the following condition is satisfied: t ffl ffl t = A net is called simple if no two transitions t 1 and t 2 have the same sets of input and output places (i.e. 8t 1 ; t 2 ....

J. Esparzaand M. Nielsen. Decidability issues for Petri nets. Petri Nets Newsletter, 94:5--23, 1994.

....can easily check that the labeled RG Figure 2,c derived for the PN from Figure 2,b is isomorphic to the TS (Figure 2,a) A net is called safe if no more than one token can appear in a place. Safe nets are especially widely used in many applications, since they have simple verification algorithms [15] and simple semantics. A net is called a pure net if (p; t) 2 F implies that (t; p) 62 F , i.e. for each transition t the following condition is satisfied: t ffl ffl t = A net is called simple if no two transitions t 1 and t 2 have the same sets of input and output places (i.e. 8t 1 ; t 2 ....

J. Esparza and M. Nielsen. Decidability issues for petri nets. Petri Nets Newsletter, 94:5--23, 1994.

....ffl a vertex for each reachable marking of the PN and ffl an arc (m 1 ; m 2 ) if and only if m 1 m 2 in some firing sequence of the PN. A net is called safe if no more than one token can appear in a place. Safe nets are used in many applications, since they have simple verification algorithms [5] and simple semantics. A labeled PN is a PN with a labeling function : T Gamma A which puts into correspondence every transition of the net with a symbol (called label) from the alphabet A. A Signal Transition Graph (STG) is a PN whose transitions are labelled with signal transitions (a , ....

J. Esparza and M. Nielsen. Decidability issues for petri nets. Petri Nets Newsletter, 94:5--23, 1994.

.... the reachability tree for a Petri net is decidable, in general, the complexity of the reachability problem is intractable; in fact, it has been shown that the reachability problem for Petri nets is EXPSPACE hard [PETE81] for special cases of Petri nets when the reachability problem is easier see [ESPA94]. Thus there is a trade off between expressiveness and complexity, which implies that in practice only special cases of the reachability problem can be incorporated into the navigation semantics of the said model. In [STOT92] a Hypertext database (called a hyperdocument) is viewed as a finite ....

J. Esparza and M. Nielson, Decidability issues for Petri nets. Bulletin of the EATCS, 52, (1994), 245-262.

....One can easily check that the RG in Figure 2(c) derived from the PN in Figure 2(b) is isomorphic to the TS (Figure 2(a) A net is called safe if no more than one token can appear in a place. Safe nets are especially widely used in many applications, since they have simple verification algorithms [20] and simple semantics. A net is called a pure net if (p; t) 2 F implies that (t; p) 62 F , i.e. for each transition t the following condition is satisfied: t ffl ffl t = A net is called simple if no two transitions t 1 and t 2 have the same sets of input and output places (i.e. 8t 1 ; t 2 ....

J. Esparza and M. Nielsen. Decidability issues for Petri nets. Petri Nets Newsletter, 94:5--23, 1994.

....between the class of programs with Z counters and Petri nets, and more precisely, between the computation of the least fixed point of programs with Z counters and the reachability problem for Petri nets. Let us first give an informal explanation of what a Petri net is. This is inspired from [12]. A Petri net is characterized by a set of places (drawn as circles) a set of transitions (drawn as bars) and for each transition , a set of weighted input arcs going from a subset of places ( input places ) to , and a set of weighted output arcs going from to a subset of places ....

J. Esparza and M. Nielsen. "Decidability Issues for Petri Nets". Bulletin of the EATCS, Number 52, Feb. 1994.

No context found.

Esparza, J. and M. Nielsen, "Decidability Issues for Petri Nets". Bulletin of the EATCS, Number 52, Feb. 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC