A reachability algorithm for general Petri nets based on transition invariants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4162 LNCS, Issue , 2006, Pages 608-621

  Kostin, Alexander E ^a  

^a EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

Author keywords

Petri nets; Reachability; Transition invariants

Indexed keywords

ALGORITHMS; CRITICAL PATH ANALYSIS; INVARIANCE; LINEAR SYSTEMS; SET THEORY;

FINITE SET; REACHABILITY; TRANSITION INVARIANTS;

PETRI NETS;

EID: 33750046647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_53     Document Type: Conference Paper

References (28)

1. Murata, T.: Petri Nets: Properties, Analysis and Applications. Proc. of the IEEE, vol. 77, no. 4 (1989) 541-580
2. Ichikawa, A., Hiraishi, K.: A Class of Petri Nets that a Necessary and Sufficient Condition for Reachability is Obtainable. Trans. SICE, vol.24, no. 6 (1988)
3. Kodarna, S., Murata, T.: On Necessary and Sufficient Reachability Condition for Some Subclasses of Petri Nets, TR UIC-EECS 88-8, University of Illinois at Chicago, June (1988)
4. Caprotti, O., Ferscha, A., Hong, H.: Reachability Test in Petri Nets by Groebner Bases, TR No. 95-03, Johannes Kepler University, Austria (1995)
5. Kostin, A.E.: The Novel Algorithm for Determining the Reachability in Acyclic Petri Nets. SIGACT News, vol. 28, no. 2 June (1997) 70-79
6. Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing, vol. 13, no. 3 (1984) 441-459
7. Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall (1981)
8. Varpaaniemi, K.: On the Stubborn Set Method in Reduced State Space Generation, PhD Thesis, Dept. of Computer Science and Engineering, Helsinki University of Technology (1998)
9. Schmidt, K.: Stubborn Sets for Model Checking the EF/AG Fragment of CTL. Fundamenta Informaticae, vol. 43, no. 1-4 (2000) 331-341
10. Peled, D.: All from One, One from All. LNCS, vol. 697, Springer-Verlag (1993) 409-423
11. Kostin, A. E.: Reachability Analysis in T-Invariant-less Petri Nets. IEEE Trans. on Automatic Control, vol. 48, no. 6 (2003) 1019-1024
12. Murata, T.: State Equation, Controllability, and Maximal Matchings of Petri Nets. IEEE Transactions on Automatic Control, vol. AC-22, no. 3, (1977) 412-416
13. Memmi, G., Roucairol, G.: Linear Algebra in Net Theory. In: Brauer, W. (ed.), Net Theory and Applications, LNCS, vol. 84, Springer-Verlag (1980) 213-223
14. Martinez, J., Silva, M.: A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net. In: Girault, C., and Reisig, W. (eds.), Application and Theory of Petri Nets, Springer-Verlag (1982) 301-310
15. Alaiwan, H., Toudic, J.-M.: Recherche des semi-flots, des verrous et des trappes dans les reseaux de Petri. Technique et Science Informatique, vol. 4, no. 1 (1985) 103-112
16. Anishev, P.A., Bandman, O L.: Algorithms and Programs for the Analysis of Properties of Petri Nets. Preprint no. 762, Academy of Science of USSR, Novosibirsk (1988)
17. Roch, S. Starke, P.H.: INA: Integrated Net Analyzer, Ver. 2.2, Humboldt-Universitat zu Berlin (2001)
18. Chiola, G., Franceschinis, G., Gaeta, R., Ribaudo, M.: GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets. Perform. Evaluation, vol. 24, no. 1&2 (1995) 47-68
19. German, R., Kelling, C., Zimmerman, A., Hommel, G.: TimeNET: A Toolkit for Evaluating Non-Markovian Stochastic Petri Nets. Perform. Evaluation, vol. 24, no. 1&2 (1995) 69-87
20. Bause, F., Kemper, P.: QPN-Tool for the Qualitative and Quantitative Analysis of Queuing Petri Nets. Lecture Notes in Computer Science, vol. 794, Springer-Verlag (1994) 321-334
21. Murata, T.: A Private Communication, April 18 (1998)
22. Goodrich, M.T., Tamassia, R.: Algorithm Design: Foundations, Analysis and Internet Examples, John Wiley & Sons (2002)
23. Springer, J.: Exact Solution of General Integer Systems of Linear Equations. ACM Trans. on Mathematical Software, vol. 12, no. 1, March (1986) 51-61
24. Howell, J.A.: Exact Solution of Linear Equations Using Residue Arithmetic. Communications of the ACM, vol. 14, no. 3 (1971) 180-184
25. Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of Some Problems in Petri Nets. Theoretical Computer Science, vol. 4 (1977) 277-299
26. Chang, Y.-L., Sullivan, R.S.: QS: Quant System, Version 2.1, Prentice-Hall (1996)
27. Watanabe, T.: The Legal Firing Sequence Problem of Petri Nets. IEICE Transactions on Inf. & Syst., vol. E83-D, no. 3 (2000) 397-406
28. Huang, J.S., and Murata, T.: A Constructive Method for Finding Legal Transition Sequences in Petri Nets. Journal of Circuits, Systems, and Computers, vol. 8, no. 1 (1998) 189-222