Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem

IEEE Transactions on Automatic Control

Volumn 62, Issue 3, 2017, Pages 1078-1093

  Ma, Ziyue ^a,b   Tong, Yin ^a,b   Li, Zhiwu ^a,c   Giua, Alessandro ^b,d  

^a XIDIAN UNIVERSITY   (China)

^b UNIVERSITY OF CAGLIARI   (Italy)

^c MACAU UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Macao)

^d AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Basis reachability graph; discrete event systems; Petri nets

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISCRETE EVENT SIMULATION; POLYNOMIAL APPROXIMATION;

CARDINALITIES; COMPACT REPRESENTATION; ITS APPLICATIONS; POLYNOMIAL-TIME; REACHABILITY; REACHABILITY GRAPHS; REACHABILITY PROBLEM; REACHABILITY SET;

PETRI NETS;

EID: 84989257686     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2016.2574120     Document Type: Article

References (34)

1. F. Basile, R. Cordone, and L. Piroddi, "Integrated design of optimal supervisors for the enforcement of static and behavioral specifications in Petri net models," Automatica, vol. 49, no. 11, pp. 3432-3439, 2013.
2. Z. Y. Ma, Z. W. Li, and A. Giua, "Design of optimal Petri net controllers for disjunctive generalized mutual exclusion constraints," IEEE Trans. Autom. Control, vol. 60, pp. 1774-1785, 2015.
3. M. Pocci, I. Demongodin, N. Giambiasi, and A. Giua, "Synchronizing sequences on a class of unbounded systems using synchronized Petri nets," Discrete Event Dynamic Syst., vol. 26, no. 1, pp. 85-105, 2016.
4. Y. F. Chen and Z. W. Li, "Design of a maximally permissive livenessenforcing supervisor with a compressed supervisory structure for flexible manufacturing systems," Automatica, vol. 47, no. 5, pp. 1028-1034, 2011.
5. A. Nazeem and S. Reveliotis, "Designing compact and maximally permissive deadlock avoidance policies for complex resource allocation systems through classification theory: The nonlinear case," IEEE Trans. Autom. Control, vol. 57, no. 7, pp. 1670-1684, 2012.
6. A. Nazeem and S. Reveliotis, "Maximally permissive deadlock avoidance for resource allocation systems with r/w-locks," Discrete Event Dynamic Syst., vol. 25, no. 1, pp. 31-63, 2015.
7. A. Giua, F. DiCesare, and M. Silva, "Generalized mutual exclusion constraints for Petri nets with uncontrollable transitions," in Proc. IEEE Int. Conf. Sys., Man, Cybern., Chicago, IL, USA, 1992, pp. 947-949.
8. Z. Y. Ma, Z. W. Li, and A. Giua, "A method to verify the controllability of language specifications in Petri nets based on basis marking analysis," in Proc. 54th IEEE Conf. Decision Control, Osaka, Japan, 2015, pp. 1675-1681.
9. Y. Tong, Z. W. Li, and A. Giua, "On the equivalence of observation structures for Petri net generators," IEEE Trans. Autom. Control, vol. 61, no. 9, 2016.
10. E. W. Mayr, "Persistence of vector replacement systems is decidable," Acta Informatica, vol. 15, no. 3, pp. 309-318, 1981.
11. R. J. Lipton, "The reachability problem requires exponential space," Res. Rep. 62, Comput. Sci. Dept., Yale Univ., Tech. Rep., 1976.
12. J. Desel and J. Esparza, Free Choice Petri Nets. Cambridge Univ. Press, Cambridge, U.K., 1995.
13. E. Pastor, J. Cortadella, and M. A. P. na, "Structural methods to improve the symbolic analysis of Petri nets," in Application and Theory of Petri Nets 1999, ser. Lecture Notes in Computer Science, S. Donatelli and J. Kleijn, Eds. Berlin, Germany: Springer-Verlag, 1999, vol. 1639, pp. 26-45.
14. A. Valmari, "Stubborn sets for reduced state space generation," in Advances in Petri Nets 1990, ser. Lecture Notes in Computer Science, G. Rozenberg, Ed. Berlin, Germany: Springer-Verlag, 1991, vol. 483, pp. 491-515.
15. F. DiCesare, H. Harhalakis, J. M. Proth, M. Silva, and F. B. Vernadat, Practice of Petri Nets in Manufacturing. London, U.K.: Chapman & Hall, 1993.
16. I. Suzuki and T. Murata, "A method for stepwise refinement and abstraction of Petri nets," J. Comput. Syst. Sci., vol. 27, no. 1, pp. 51-76, 1983.
17. P. Küngas, "Petri net reachability checking is polynomial with optimal abstraction hierarchies," in Abstraction, Reformulation and Approximation. New York, NY, USA: Springer-Verlag, 2005, pp. 149-164.
18. S. Christensen and L. Petrucci, "Modular analysis of Petri nets," Comput. J., vol. 43, no. 3, pp. 57-64, 2000.
19. T. Miyamoto and K. Horiguchi, "Modular reachability analysis of Petri nets for multiagent systems," IEEE Trans. Syst., Man, Cybern., Syst., vol. 43, no. 6, pp. 1411-1423, 2013.
20. J. Ezpeleta, J. M. Colom, and J. Martinez, "A Petri net based deadlock prevention policy for flexible manufacturing systems," IEEE Trans. Robot. Autom., vol. 11, no. 2, pp. 173-184, 1995.
21. Z. W. Li and M. C. Zhou, "Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems," IEEE Trans. Syst., Man, Cybern. A, vol. 34, no. 1, pp. 38-51, 2004.
22. Z. W. Li and M. C. Zhou, "Control of elementary and dependent siphons in Petri nets and their application," IEEE Trans. Syst., Man, Cybern. A, vol. 38, no. 1, pp. 133-148, 2008.
23. M. Cabasino, A. Giua, and C. Seatzu, "Fault detection for discrete event systems using Petri nets with unobservable transitions," Automatica, vol. 46, no. 9, pp. 1531-1539, 2010.
24. M. Cabasino, A. Giua, M. Pocci, and C. Seatzu, "Discrete event diagnosis using labeled Petri nets: an application to manufacturing systems," Control Eng. Practice, vol. 19, no. 9, pp. 989-1001, 2011.
25. Y. Tong, Z. W. Li, C. Seatzu, and A. Giua, "Verification of current-state opacity using Petri nets," in Proc. 34th Amer. Control Conf., Chicago, IL, USA, 2015, pp. 1935-1940.
26. Y. Tong, Z. W. Li, C. Seatzu, and A. Giua, "Verification of initial-state opacity in DES," in Proc. 54th IEEE Conf. Decision Control, Osaka, Japan, 2015, pp. 344-349.
27. Y. Tong, Z. W. Li, C. Seatzu, and A. Giua, "Verification of state-based opacity using Petri nets," IEEE Trans. Autom. Control, submitted for publication.
28. Y. Ru, M. Cabasino, A. Giua, and C. Hadjicostis, "Supervisor synthesis for discrete event systems with arbitrary forbidden state specifications," in Proc. 47th IEEE Conf. Decision Control, Cancun, Mexico, 2008, pp. 1048-1053.
29. D. Corona, A. Giua, and C. Seatzu, "Marking estimation of Petri nets with silent transitions," IEEE Trans. Autom. Control, vol. 52, no. 9, pp. 1695-1699, 2007.
30. A. Giua and C. Seatzu, "Fault detection for discrete event systems using Petri nets with unobservable transitions," in Proc. 44th Int. Conf. Decision Control Eur. Control Conf., Seville, Spain, 2005, pp. 6323-6328.
31. W. M. P. van der Aalst, "The application of Petri nets to workflow management," J. Circuits, Syst., Comput., vol. 8, no. 1, pp. 21-66, 1998.
32. S. Janson, T. Luczak, and A. Rucinski, Random Graphs. NewYork, NY, USA: Wiley, 2000.
33. A. J. Hoffman and J. B. Kruskal, "Integral boundary points of convex polyhedra," in 50 Years of integer programming 1958-2008, E. Michael Jünger, Ed. Berlin, Germany: Springer-Verlag, 2010, pp. 49-76.
34. L. E. Dickson, "Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors," Amer. J. Math., vol. 35, no. 4, pp. 413-422, 1913.