G Ciardo. Petri nets with marking-dependent arc cardinality. In R. Valette, editor, Proc. of Application and Theory of Petri-Nets, volume 815 of Lecture Notes in Computer Science, pages 179--198, Zaragoza, Spain, 1994. Springer Verlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....are integer numbers assigned to the transitions. A transition is enabled in a marking if and only if no higher priority transitions are enabled. If this extension is introduced, some markings of the original PN may no longer be reachable. Marking dependent arc multiplicity was introduced in [35, 36] with the intent to model situations in which the number of tokens to be transferred along the arcs (or to enable a transition) depends upon the system state. Arcs with marking dependent multiplicity are indicated by a Z on the arc, and allow simpler and more compact PNs than would otherwise be ....

G. Ciardo. Petri nets with marking-dependent arc cardinality: properties and analysis. In Proceedings of the 15-th International Conference on Application and Theory of Petri Nets, pages 179--198. Lectures Notes in Computer Science #815 - Springer Verlag, 1994.

....are integer numbers assigned to the transitions. A transition is enabled in a marking if and only if no higher priority transitions are enabled. If this extension is introduced, some markings of the original PN may no longer be reachable. Marking dependent arc multiplicity was introduced in [40, 41] with the intent to model situations in which the number of tokens to be transferred along the arcs (or to enable a transition) depends upon the system state. Arcs with marking dependent multiplicity are indicated by a Z on the arc, and allow simpler and more compact PNs than would otherwise be ....

G. Ciardo. Petri nets with marking-dependent arc cardinality: properties and analysis. In Proceedings of the 15-th International Conference on Application and Theory of Petri Nets, pages 179-198. Lectures Notes in Computer Science #815 - Springer Verlag, 1994.

....place. That it is a wqo is known as Dickson s lemma [Dic13] Petri nets with inhibitory arcs extend the basic model with special inhibitory arcs (also called zero test arcs) that forbid (inhibit) the firing of a given transition when a given place is not empty. Petri nets with transfer arcs [Cia94] extend the basic model with special transfer arcs. Here transitions fire as usual but their effect is richer: the transfer arcs say whether the full content of some place must be transfered (added) to some other place. Petri nets with reset arcs [Cia94] extend the basic model with special ....

....empty. Petri nets with transfer arcs [Cia94] extend the basic model with special transfer arcs. Here transitions fire as usual but their effect is richer: the transfer arcs say whether the full content of some place must be transfered (added) to some other place. Petri nets with reset arcs [Cia94] extend the basic model with special reset arcs telling how the firing of some transitions resets (empties) some places. Self modifying nets [Val78] are Petri nets where the weight on arcs is not a constant anymore. Rather it is an expression evaluating into a linear combination (with ....

G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179--198. Springer-Verlag, 1994.

....Petri net models. First of all, since tokens in a system net may be just black dots, we immediately get Proposition 4.1. Ordinary Petri nets form a special case of nested Petri nets. Then we compare nested Petri nets with some extensions of ordinary Petri net model. Petri nets with reset arcs [Cia94] extend the basic model with special reset arcs, which denote that ring of some transitions resets (empties) the corresponding places. Theorem 4.2. Petri nets with reset arcs can be simulated by nested Petri nets with ordinary Petri nets as object nets. Proof. The idea is to simulate the ....

G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Application and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179-198. Springer, 1994.

....with reset arcs. AL78] shows that coverability is decidable for VASS s with reset arcs. May98] gives several undecidability results for lossy counter machines with applications to, e.g. Reset and Transfer nets. Reset and Transfer nets are a subset of Valk s self modifying nets [Val78] LC94,Cia94] consider them from an expressivity perspective. For many purposes, Reset and Transfer nets are very close to other infinitestate models currently under study. The undecidability of boundedness for Reset 1 Another surprise is that place boundedness ( is a given place bounded ) is not ....

....of the following two types (assuming 0 k; k 1 ; k 2 n and c 2 fc 1 ; c 2 ; c m g) 3 It is believed that Transfer nets are strictly more expressive (in terms of generated languages) than Reset nets but we know of no formal proof for this. Indeed, the example given to that purpose in [Cia94] his Fig. 14) is flawed and can be encoded into a Reset net. c : c 1; goto k if c 0 then (c : c Gamma 1; goto k 1 ) else goto k 2 We shall refer to the obvious notion of the (unique) computation of M on given input values of the counters (the computation is either finite, i.e. ....

G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications & Theory of Petri Nets, Zaragoza, Spain, June 1994, vol. 815 of LNCS, pp 179--198. Springer, 1994.

....3 1 p 2 4 p 2 1 p 2 p 2 3 = Theta M 6 M 0 p 3 1 p 2 p 3 p 4 Theta = M 7 M 0 ; M 3 M 3 M 5 M 6 Theta M 0 M 7 Theta M 2 t 1 t 2 t 3 8 9 s1 s2 t1 t2 OE OE Fig. 4. Strict compatibility colored Petri nets, or Valk s post SM nets [Val78] Other extensions of Petri nets [Cia94,LC94] allow special kind of arcs, e.g. reset arcs which empty the attached place when the corresponding transition is fired, transfer arcs which move all tokens from a given place to another place, and copy arcs which add a copy of every tokens from some place to a given place. All these ....

G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179--198. Springer-Verlag, 1994.

....(or zero test ) arcs are Turing powerful. By contrast, the study of decidability issues for Petri nets with Reset arcs only started in [AK77] where the Reachability problem is shown undecidable. Then, language theoretical properties and extensions of p semi flows techniques were studied in [Cia94] for Reset 61, av. Pdt Wilson; 94235 Cachan Cedex; FRANCE. email: fdufourd, finkel, phsg lsv.ens cachan.fr. and other) arcs. Recently, KCK 97] announced that the Boundedness problem is decidable for Petri nets extended with Reset arcs (actually for their more general PCN model) It ....

....Karp and Miller algorithm) for Post SM nets. Lakos and Christensen [LC94] compared different sets of primitives for extended arcs, essentially from a modelization point of view. Billington modelized the Cambridge Ring Network using Reset arcs [Bil91] See the bibliographies in [Cia94,LC94] for other applications of Petri nets with Reset and Transfer arcs. Because we are not concerned with true concurrency issues, we see Read arcs [Vog97] as classical arcs. Plan of the paper. We define G nets and relevant subclasses in Sections 2 and 3. Then we study Coverability and ....

[Article contains additional citation context not shown here]

G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179--198. Springer-Verlag, 1994.

No context found.

G Ciardo. Petri nets with marking-dependent arc cardinality. In R. Valette, editor, Proc. of Application and Theory of Petri-Nets, volume 815 of Lecture Notes in Computer Science, pages 179--198, Zaragoza, Spain, 1994. Springer Verlag.

No context found.

Ciardo, G., Petri nets with marking-dependent arc cardinality: Properties and analysis, in: Proc. 15th Int. Conf. Application and Theory of Petri Nets (ICATPN'94), Zaragoza, Spain, June

No context found.

G. Ciardo. Petri nets with marking-dependent arc cardinality: properties and analysis. In Proceedings of the 15-th International Conference on Application and Theory of Petri Nets, pages 179--198. Lectures Notes in Computer Science #815 - Springer Verlag, 1994.

No context found.

G. Ciardo, Petri Nets with Marking-Dependent Arc Cardinality: Properties and Analysis, Advances in Petri Nets (1994), LNCS, Springer-Verlag, pp. 179-198.

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