Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets

Fundamenta Informaticae

Volumn 37, Issue 3, 1999, Pages 247-268

  Heljanko, Keijo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; LOGIC PROGRAMMING; PETRI NETS; THEOREM PROVING;

BRANCH AND BOUND ALGORITHMS; MIXED INTEGER PROGRAMMING;

COMPUTER SYSTEM RECOVERY;

EID: 0032639194     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-37304     Document Type: Article

References (20)

1. 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.
2. J. C. Corbett. Evaluating deadlock detection methods for concurrent software. Technical report, Department of Information and Computer Science, University of Hawaii at Manoa, 1995.
3. J. Engelfriet. Branching processes of Petri nets. In Acta Informatica 28, pages 575-591, 1991.
4. J. Esparza and M. Nielsen. Decidability issues for Petri Nets - a survey. Journal of Information Processing and Cybernetics 30(3), pages 143-160, 1994.
5. 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.
6. M. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, New York, 1990.
7. 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.
8. B. Grahlmann. The PEP Tool. In Proceeding of 9th International Conference on Computer Aided Verification (CAV'97), pages 440-443. Springer-Verlag, June 1997. LNCS 1254.
9. 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, Informatik-Bericht Nr. 110, pages 106-115. Humboldt-University, Berlin, September 1998.
10. K. Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. In Proceedings of Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), pages 240-254. Springer-Verlag, Berlin, March 1999. LNCS 1579.
11. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588-619, 1991.
12. 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.
13. 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.
14. 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.
15. 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.
16. 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.
17. 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.
18. P. Simons. Extending the stable model semantics with more expressive rules, 1998. Unpublished manuscript.
19. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1:297-322, 1992.
20. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, July 1991.