Processes of Petri Nets with Range Testing

• Autorzy: Kleijn J. , Koutny M.
• Języki publikacji: EN

Abstrakty

EN

We are concerned with causality semantics in the executions of Petri nets with range arcs. Range arcs combine (and subsume) the distinctive features of inhibitor and activator arcs, and each such arc provides a means of specifying a range (a finite or infinite interval of non-negative integers) for the number of tokens in a place which makes enabling of a given transition possible. We demonstrate that the existing treatment of causality developed for Petri nets with inhibitor arcs based on structures generalising partial orders can also be applied to nets with range arcs.

Słowa kluczowe

EN

theory of concurrency; Petri net; weighted activator and inhibitor arcs; range arcs; causality semantics; infinite processes; occurrence (Petri) nets; step sequences

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 80, nr 1-3
• Strony: 199--219
• Opis fizyczny: bibliogr. 24 poz.

Twórcy

autor

Kleijn J.

autor

Koutny M.

• L.I.A.C.S., Leiden University, P.O. Box 9512, NL-2300 RA Leiden, The Netherlands,

Bibliografia

• [1] E.Best and R.Devillers (1988). Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55, 87-136.
• [2] J.Billington (1998). Protocol Specification Using P-Graphs, a Technique Based on Coloured Petri Nets. In: Part II of [20], 331-385.
• [3] N.Busi and G.M.Pinna (1999). Process Semantics for Place/Transition Nets with Inhibitor and Read Arcs. Fundamenta Informaticae 40, 165-197.
• [4] J.Desel, W.Reisig and G.Rozenberg (Eds.) (2004). Lectures on Concurrency and Petri Nets. Springer-Verlag, Lecture Notes in Computer Science 3098.
• [5] S.Donatelli and G.Franceschinis (1998). Modelling and Analysis of Distributed Software Using GSPNs. In: Part II of [20], 438-476.
• [6] J.Engelfriet (1991). Branching Processes of Petri Nets. Acta Informatica 28, 575-591.
• [7] H.Ehrig, G.Juhás, J.Padberg and G.Rozenberg (Eds.) (2001). Unifying Petri Nets. Springer-Verlag, Lecture Notes in Computer Science 2128.
• [8] J.Esparza and G.Bruns (1996). Trapping Mutual Exclusion in the Box Calculus. Theoretical Computer Science 153, 95-128.
• [9] P.W.Hoogers, H.C.M.Kleijn and P.S.Thiagarajan (1995). A Trace Semantics for Petri Nets. Information and Computation 117, 98-114.
• [10] R.Janicki and M.Koutny (1995). Semantics of Inhibitor Nets. Information and Computation 123, 1-16.
• [11] V.Khomenko and C.Schröter (2004). Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings. Proc. of CAV'04, R.Alur and D.A.Peled (Eds.). Springer-Verlag, Lecture Notes in Computer Science 3114, 109-121.
• [12] H.C.M.Kleijn and M.Koutny (2004). Process Semantics of General Inhibitor Nets. Information and Computation 190, 18-69.
• [13] H.C.M.Kleijn and M.Koutny (2006). Infinite Process Semantics of Inhibitor Nets. Proc. of ICATPN'06, S.Donatelli and P.S.Thiagarajan (Eds.). Springer-Verlag, Lecture Notes in Computer Science 4024, 282-301.
• [14] H.C.M.Kleijn andM.Koutny (2006). Synchrony and Asynchrony in Membrane Systems. Proc. of WMC'06, H.J.Hoogeboom, Gh.P˘aun and G.Rozenberg (Eds.). Springer-Verlag, Lecture Notes in Computer Science 4361, 66-85.
• [15] A.Mazurkiewicz (1977). Concurrent Program Schemes and Their Interpretations. Technical Report DAIMIPB-78, Aarhus University.
• [16] A.Mazurkiewicz (1987). Trace Theory. In: Petri Nets, Applications and Relationship to other Models of Concurrency,W.Brauer et al. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 255. 279-324.
• [17] K.L.McMillan (1995). A Technique of State Space Search Based on Unfoldings. Formal Methods in System Design 6, 45-65.
• [18] Gh.Pǎun (2002). Membrane Computing. An Introduction. Springer-Verlag.
• [19] Gh.Pǎun and G.Rozenberg (2002). A Guide to Membrane Computing. Theoretical Computer Science 287, 73-100.
• [20] W.Reisig and G.Rozenberg (Eds.) (1998). Lectures on Petri Nets. Springer-Verlag, Lecture Notes in Computer Science 1491,1492.
• [21] G.Rozenberg and J.Engelfriet (1998). Elementary Net Systems. In: Advances in Petri Nets. Lectures on Petri Nets I: Basic Models,W.Reisig and G.Rozenberg (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1491. 12-121.
• [22] I.A.Stewart (1995). Reachability in Some Classes of Acyclic Petri Nets. Fundamenta Informaticae 23, 91-100.
• [23] W.Vogler, A.L.Semenov and A.Yakovlev (1998).Unfolding and Finite Prefix for Nets with Read Arcs. Proc. of CONCUR'98, D.Sangiorgi and R.de Simone (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1466, 501-516.
• [24] W.Vogler (2002). Partial Order Semantics and Read Arcs. Theoretical Computer Science 286, 33-63.