Abstract
McMillan has presented a deadlock detection method for Petri nets based on finite complete prefixes (i.e. net unfoldings). The basic idea is to transform the PSPACE-complete deadlock detection problem for a 1-safe Petri net into a potentially exponentially larger NP-complete problem of deadlock detection for a finite complete prefix. McMillan suggested a branch-and-bound algorithm for deadlock detection in prefixes. Recently, Melzer and Rmer have presented another approach, which is based on solving mixed integer programming problems. In this work it is shown that instead of using mixed integer programming, a constraint-based logic programming framework can be employed, and a linear-size translation from deadlock detection in prefixes into the problem of finding a stable model of a logic program is presented. As a side result also such a translation for solving the reachability problem is devised. Experimental results are given from an implementation combining the prefix generator of the PEP-tool, the translation, and an implementation of a constraint-based logic programming framework, the smodels system. The experiments show the proposed approach to be quite competitive, when compared to the approaches of McMillan and Melzer/Rmer.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Best. Partial order verification with PEP. In G. Holzmann, D. Peled, and V. Pratt, editors, Proceedings of POMIV’96, Workshop on Partial Order Methods in Verification. American Mathematical Society, July 1996.
J. C. Corbett. Evaluating deadlock detection methods for concurrent software. Technical report, Department of Information and Computer Science, University of Hawaii at Manoa, 1995.
J. Engelfriet. Branching processes of Petri nets. In Acta Informatica 28, pages 575–591, 1991.
J. Esparza and M. Nielsen. Decidability issues for Petri Nets-a survey. Journal of Information Processing and Cybernetics 30(3), pages 143–160, 1994.
J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan’s unfolding algorithm. In Proceedings of Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), pages 87–106, Passau, Germany, Mar 1996. Springer-Verlag. LNCS 1055.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pages 1070–1080, Seattle, USA, August 1988. The MIT Press.
B. Grahlmann. The PEP Tool. In Proceedings of CAV’97 (Computer Aided Verification), pages 440–443. Springer-Verlag, June 1997. LNCS 1254.
K. Heljanko. Deadlock checking for complete finite prefixes using logic programs with stable model semantics (extended abstract). In Proceedings of the Workshop Concurrency, Specification &Programming 1998. Humboldt-University, Berlin, September 1998. Accepted for publication. Available at http:// saturn.hut.fi/~kepa/publications/KH csp98.ps.gz.
W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588–619, 1991.
K. L. McMillan. Using unfoldings to avoid the state space explosion problem in the verification of asynchronous circuits. In Proceeding of 4th Workshop on Computer Aided Verification (CAV’92), pages 164–174, 1992. LNCS 663.
K. L. McMillan. A technique of a state space search based on unfolding. In Formal Methods is System Design 6(1), pages 45–65, 1995.
S. Melzer and S. Römer. Deadlock checking using net unfoldings. In Proceeding of 9th International Conference on Computer Aided Verification (CAV’97), pages 352–363, Haifa, Israel, Jun 1997. Springer-Verlag. LNCS 1254.
I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72–79, Trento, Italy, May 1998. Helsinki University of Technology, Digital Systems Laboratory, Research Report A52.
I. Niemelä and P. Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 420–429, Dagstuhl, Germany, July 1997. Springer-Verlag.
P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research Report A47, Helsinki University of Technology, Espoo, Finland, August 1997. Licenciate’s thesis, Available at http:// saturn.hut.fi/pub/reports/A47.ps.gz.
A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1 (1992):297–322.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heljanko, K. (1999). Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. In: Cleaveland, W.R. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1999. Lecture Notes in Computer Science, vol 1579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49059-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-49059-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65703-3
Online ISBN: 978-3-540-49059-3
eBook Packages: Springer Book Archive