Abstract
This paper focuses on the resolution of the reachability problem in Petri nets, using the logical abstraction technique and the mathematical programming paradigm. The proposed approach is based on an implicit exploration of the Petri net reachability graph. This is done by constructing a unique sequence of partial steps. This sequence represents exactly the total behavior of the net. The logical abstraction technique leads us to solve a constraint satisfaction problem. We also propose different new formulations based on integer and/or binary linear programming. Our models are validated and compared on large data sets, using Prolog IV and Cplex solvers.
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
Benasser, A.: L’accessibilité dans les réseaux de Petri: une approche basée sur la programmation par contraintes. PhD thesis, Université des sciences et technologies de Lille (2000)
Benasser, A., Yim, P.: Railway traffic planning with petri nets and constraint programming. JESA 33(8-9), 959–975 (1999)
Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 359–376. Springer, Heidelberg (1986)
Bourdeaud’huy, T., Hanafi, S., Yim, P.: Résolution du problème d’accessibilité dans les réseaux de Petri par l’abstraction logique et la programmation mathématique. Technical report, L.A. G. I. S., Ecole Centrale de Lille (2004)
Briand, C.: Solving the car-sequencing problem using petri nets. In: International Conference on Industrial Engineering and Production Management, vol. 1, pp. 543–551 (1999)
Fernandez, J.-C., Jard, C., Jéron, T., Mounier, L.: “on the fly” verification of finite transition systems. Formal Methods in System Design (1992)
Gunnarsson, J.: Symbolic tools for verification of large scale DEDS. In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC 1998), San Diego, CA, October 11-14, pp. 722–727 (1998)
Huber, P., Jensen, A.M., Jepsen, L.O., Jensen, K.: Towards reachability trees for high-level petri nets. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol. 188, pp. 215–233. Springer, Heidelberg (1985)
Jaffar, J., Michaylov, Stuckey, P., Yap, R.: The clp(r) language and system. ACM Transactions on Programming Languages and Systems 14(3), 339–395 (1992)
Keller, R.M.: Formal verification of parallel programs. Comm. of the ACM 19(7), 371–384 (1976)
Kosaraju, S.R.: Decidability and reachability in vector addition systems. In: Proc. of the 14th Annual ACM Symp. on Theory of Computing, pp. 267–281 (1982)
Lautenbach, K.: Linear algebraic techniques for place/transition nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 142–167. Springer, Heidelberg (1987)
Lee, D.Y., DiCesare, F.: Scheduling flexible manufacturing systems using petri nets and heuristic search. IEEE Transactions on Robotics and Automation 10(2), 123–132 (1994)
Lindqvist, M.: Parameterized reachability trees for predicate/transition nets. In: Rozenberg, G. (ed.) APN 1993. LNCS, vol. 674, pp. 301–324. Springer, Heidelberg (1993)
Lipton, R.: The reachability problem requires exponential space. Technical report, Computer Science Dept., Yale University (1976)
Murata, T.: Petri nets: properties, analysis ans applications. In: Proceedings of the IEEE, vol. 77, pp. 541–580 (1989)
Parker, R.G., Rardin, R.L.: Discrete Optimization. Academic Press, London (1988)
Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991)
Vernadat, F., Azéma, P., Michel, P.: Covering steps graphs. In: 17 th Int. Conf on Application and Theory of Petri Nets 1996 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bourdeaud’huy, T., Hanafi, S., Yim, P. (2004). Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive