Analyzing Reachability for Some Petri Nets With Fast Growing Markings

Electronic Notes in Theoretical Computer Science

Volumn 223, Issue C, 2008, Pages 215-237

  Praveen, M ^a   Lodaya, Kamal ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

partially bounded net; Petri net; reachability problem; T invariant less net

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; MARINE BIOLOGY; PETRI NETS; SURVEYS;

ALGEBRAIC TECHNIQUES; NIELSEN; PARTIALLY BOUNDED NET; PETRI NET; REACH ABILITIES; REACHABILITY PROBLEM; T-INVARIANT-LESS NET; UPPER BOUNDS;

GRAPH THEORY;

EID: 57849130290     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.12.041     Document Type: Article

References (23)

1. Borosh I., and Treybig L. Bounds on positive integral solutions of linear diophantine equations. Proc. Amer. Math. Soc. 55 (1976) 299-304
2. Cheng A., Esparza J., and Palsberg J. Complexity results for 1-safe nets. Theor. Comput. Sci. 147 (1995) 117-136
3. Desel J. Basic linear algebraic techniques for place/transition nets. LNCS 1491 (1998) 257-308
4. Esparza J. Decidability and complexity of Petri net problems - An introduction. LNCS 1491 (1998) 374-428
5. Esparza J., and Nielsen M. Decidability issues for Petri nets - a survey. J. Inform. Process. Cybernet. 30 (1994) 143-160
6. Hopcroft J., and Pansiot J. On the reachability problem for 5-dimensional vector addition systems. Theoret. Comput. Sci. 8 (1978) 135-159
7. Karp R., and Miller R. Parallel program schemata. J. Comput. Syst. Sci. 3 (1969) 147-195
8. Kosaraju, S., Decidability of reachability in vector addition systems, in: Proc. 14th Annual ACM STOC, 1982, pp. 267-281
9. Kostin A. Reachability analysis in T-invariant-less Petri nets. IEEE Trans. Autom. Contr. 48 (2003) 1019-1024
10. Kostin A. A reachability algorithm for general Petri nets based on transition invariants. In: Kralovic R., and Urzyczyn P. (Eds). Math. Found. Comp. Sci. LNCS 4162 (2006) 608-621
11. Kostin A. Using Transition Invariants for Reachability Analysis of Petri Nets. In: Kordic V. (Ed). Petri Net: Theory and Applications (2008), I-Tech Edu. Pub. 435-458
12. Krückeberg F., and Jaxy M. Mathematical methods for calculating invariants in Petri nets. LNCS 266 (1987) 104-131
13. Lambert J. A structure to decide reachability in Petri nets. Theoret. comp. sci. 99 (1992) 79-104
14. Lautenbach K. Linear algebraic techniques for place/transition nets. LNCS 254 (1987) 142-167
15. Lipton, R., The reachability problem requires exponential space, Technical Report 62, Yale university (1975)
16. Mayr, E., An algorithm for the general Petri net reachability problem, in: Proc. 13th Annual ACM STOC, 1981, pp. 238-246
17. Memmi G., and Roucairol G. Linear algebra in net theory. LNCS 84 (1980) 213-223
18. P. Jančar, Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm, unpublished
19. Praveen, M., "Complexity of the reachability problem in subclasses of Petri nets," Master's thesis, Homi Bhabha National Institute (2008)
20. Rackoff C. The covering and boundedness problems for vector addition systems. Theoret. Comput. Sci. 6 (1978) 223-231
21. Reutenauer C. The mathematics of Petri nets (1990), Prentice-Hall (Translated by I. Craig)
22. Silva M., Teruel E., and Colom J.M. Linear algebraic and linear programming techniques for the analysis of place/transition net systems. LNCS 1491 (1998) 309-373
23. Valk R., and Vidal-Naquet G. Petri nets and regular languages. J. Comput. Syst. Sci. 23 (1981) 299-325