Bounded LTL model checking with stable models

Theory and Practice of Logic Programming

Volumn 3, Issue 4-5, 2003, Pages 519-550

  Heljanko, Keijo ^a   Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Bounded model checking; LTL; Stable models; Step semantics

Indexed keywords

BOOLEAN FUNCTIONS; FINITE AUTOMATA; KNOWLEDGE REPRESENTATION; PETRI NETS; SEMANTICS; SEQUENTIAL CIRCUITS; SET THEORY;

ANSWER SET PROGRAMMING; CONCURRENT SYSTEMS; STABLE MODELS;

LOGIC PROGRAMMING;

EID: 0344100088     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068403001790     Document Type: Article

References (25)

1. BEST, E. AND DEVILLERS, R. 1987. Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science 55, 1,-87-136.
2. BIERE, A., CIMATTI, A., CLARKE, E. AND ZHU, Y. 1999. Symbolic model checking without BDDs. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99): Lecture Notes in Computer Science 1579, pp. 193-207. Springer-Verlag.
3. 20 states and beyond. Information and Computation 98, 2, 142-170.
4. CIMATTI, A., CLARKE, E. M., GIUNCHIGLIA, E., GIUNCHIGLIA, F. PISTORE, M., ROVERI, M., SEBASTIANI, R. AND TACCHELLA, A. 2002. NuSMV 2: An opensource tool for symbolic model checking. Proceedings 14th International Conference on Computer-Aided Verification (CAV'2002): Lecture Notes in Computer Science 2404, pp. 359-364. Springer-Verlag.
5. CIMATTI, A., PISTORE, M., ROVERI, M. AND SEBASTIANI, R. 2002. Improving the encoding of LTL model checking into SAT. Proceedings Workshop on Verification Model Checking and Abstract Interpretation (VMCAI'2002): Lecture Notes in Computer Science 2294, pp. 196-207. Springer-Verlag.
6. CLARKE, E., GRUMBERG, O. AND PELED, D. 1999. Model Checking. The MIT Press.
7. CORBETT, J. C. 1995. Evaluating deadlock detection methods for concurrent software. Technical report, Department of Information and Computer Science, University of Hawaii at Manoa.
8. DESEL, J. AND REISIG, W. 1998. Place/Transition Petri nets. Lectures on Petri Nets I: Basic Models: Lecture Notes in Computer Science 1491, pp. 122-173. Springer-Verlag.
9. ESPARZA, J. 1998. Decidability and complexity of Petri net problems - An introduction. Lectures on Petri Nets I: Basic Models: Lecture Notes in Computer Science 1491, pp. 374-428. Springer-Verlag.
10. FAGES, F. 1994. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
11. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. Proceedings 5th International Conference on Logic Programming, pp. 1070-1080. MIT Press.
12. Heljanko, K. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae 37, 3, 247-268.
13. HELJANKO, K. 2001. Bounded reachability checking with process semantics. Proceedings 12th International Conference on Concurrency Theory (Concur'2001): Lecture Notes in Computer Science 2154, pp. 218-232. Springer-Verlag.
14. HELJANKO, K. AND NIEMELÄ, I. 2001. Bounded LTL model checking with stable models. Proceedings 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'2001): Lecture Notes in Computer Science 2173, pp. 200-212. Springer-Verlag.
15. HOLZMANN, G. 1997. The model checker SPIN. IEEE Transactions on Software Engineering 23, 5, 279-295.
16. LIFSCHITZ, V. 1999. Answer set planning. In Proceedings 16th International Conference on Logic Programming, pp. 25-37. MIT Press.
17. LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. Proceedings 11th International Conference on Logic Programming, pp. 23-37. MIT Press.
18. MAREK, W. AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: a 25-Year Perspective, pp. 375-398. Springer-Verlag.
19. MELZER, S. AND RÖMER, S. 1997. Deadlock checking using net unfoldings. Proceeding 9th International Conference on Computer Aided Verification (CAV'97): Lecture Notes in Computer Science 1254, pp. 352-363. Springer-Verlag.
20. MOSKEWICZ, M., MADIGAN, C., ZHAO, Y., ZHANO, L. AND MALIK, S. 2001. Chaff: Engineering an efficient SAT solver. Proceedings 38th Design Automation Conference (DAC'2001), pp. 530-535. ACM.
21. NIEMELÄ, I. 1999. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3,4, 241-273.
22. NIEMELÄ, I. AND SIMONS, P. 2000. Extending the Smodels system with cardinality and weight constraints. In: Minker, J. (ed.), Logic-Based Artificial Intelligence, pp. 491-521. Kluwer Academic.
23. POKORNY, L. R. AND RAMAKRISHNAN, C. 2000. Model checking linear temporal logic using tabled logic programming. Workshop on Tabulation in Parsing and Deduction.
24. RAMAKRISHNAN, C., RAMAKRISHNAN, I., SMOLKA, S. A., DONG, Y., Du, X., ROYCHOUDHURY, A. AND VENKATAKRISHNAN, V. 2000. XMC: A logic-programming-based verification toolset. Proceedings 12th International Conference on Computer Aided Verification (CAV'2000): Lecture Notes in Computer Science 1855, pp. 576-580. Springer-Verlag.
25. VARPAANIEMI, K., HELJANKO, K. AND LILIUS, J. 1997. PROD 3.2 - An advanced tool for efficient reachability analysis. Proceedings 9th International Conference on Computer Aided Verification (CAV'97): Lecture Notes in Computer Science 1254, pp. 472-475. Springer-Verlag.