Abstract
Abstract interpretation is a paradigm that has been successfully used in the verification and optimization of programs. This paper presents a new approach for the analysis of Petri Nets based on abstract interpretation. The main contribution is the capability of deriving non-structural invariants that can increase the accuracy of structural methods in calculating approximations of the reachability space. This new approach is illustrated with the verification of two examples from the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 337–354. Springer, Heidelberg (2003)
Bérard, B., Fribourg, L.: Reachability analysis of (timed) Petri nets using real arithmetic. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 178–193. Springer, Heidelberg (1999)
Chernikova, N.: Algoritm for discovering the set of all solutions of a linear programming problem. USSR Computational Mathematics and Mathematical Physics 6(8), 282–293 (1964)
Chu, F., Xie, X.-L.: Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Transactions on Robotics and Automation 13(6), 793–804 (1997)
Commoner, F.: Deadlocks in Petri Nets. Wakefield: Applied Data Research, Inc., CA-7206–2311 (1972)
Cousot, P.: Abstract interpretation: Achievements and perspectives. In: Proc. of the SSGRR 2000 Computer & eBusiness Int. Conf., Scuola Superiore G. Reiss Romoli (July 2000)
Cousot, P.: Abstract interpretation based formal methods and future challenges (invited paper). In: Wilhelm, R. (ed.) Informatics: 10 Years Back, 10 Years Ahead. LNCS, vol. 2000, pp. 138–156. Springer, Heidelberg (2001)
Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proc. of the 2nd Int. Symposium on Programming, pp. 106–130. Dunod, Paris, France (1976)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp. 238–252. ACM Press, New York (1977)
Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proc. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp. 84–97. ACM Press, New York (1978)
Couvreur, J.M., Paviot-Adet, E.: New structural invariants for petri nets analysis. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 199–218. Springer, Heidelberg (1994)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, Heidelberg (1998)
Fribourg, L., Olsén, H.: Proving safety properties of infinite state systems by compilation into presburger arithmetics. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 213–227. Springer, Heidelberg (1997)
Grayson, D.R., Stillman, M.E.: Macaulay 2, a Software System for Research in Algebraic Geometry. Available at, http://www.math.uiuc.edu/Macaulay2/
Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11(2), 157–185 (1997)
Memmi, G., Vautherin, J.: Computation of flows for unary-predicates/transition nets. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol. 188, pp. 455–467. Springer, Heidelberg (1985)
Miné, A.: The octagon abstract domain. In: Analysis, Slicing and Tranformation (in Working Conference on Reverse Engineering), October 2001. IEEE, pp. 310–319. IEEE CS Press, Los Alamitos (2001)
Müller-Olm, M., Seidl, H.: Computing Polynomial Program Invariants. Information Processing Letters (IPL) 91(5), 233–244 (2004)
Murata, T.: State equation, controllability, and maximal matchings of petri nets. IEEE Trans. Autom. Contr. 22(3), 412–416 (1977)
Murata, T.: Petri nets: Properties, analysis and applications. Proc. of the IEEE 77(4) (1989)
New Polka: Convex Polyhedra Library, http://www.irisa.fr/prive/bjeannet/newpolka.html
Rodríguez-Carbonell, E., Kapur, D.: An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 280–295. Springer, Heidelberg (2004)
Sankaranarayanan, S., Sipma, H., Manna, Z.: Petri net analysis using invariant generation. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 682–701. Springer, Heidelberg (2004)
Silva, M., Teruel, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place/transition net systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 309–373. Springer, Heidelberg (1998)
Zhou, M., DiCesare, F., Desrochers, A.: A hybrid methodology for synthesis of Petri net models for manufacturing systems. IEEE Transactions on Robotics and Automation 8(3), 350–361 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clarisó, R., Rodríguez-Carbonell, E., Cortadella, J. (2005). Derivation of Non-structural Invariants of Petri Nets Using Abstract Interpretation. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_12
Download citation
DOI: https://doi.org/10.1007/11494744_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26301-2
Online ISBN: 978-3-540-31559-9
eBook Packages: Computer ScienceComputer Science (R0)