Bounded LTL model checking with stable models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2173 LNAI, Issue , 2001, Pages 200-212

  Heljanko, Keijo ^a   Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; APPLICATION AREA; ASYNCHRONOUS CONCURRENT; ASYNCHRONOUS SYSTEM; BOUNDED MODEL CHECKING; COMMUNICATING AUTOMATA; DEADLOCK DETECTION; ENCODINGS; LINEAR TEMPORAL LOGIC; LOGIC PROGRAMS; LTL MODEL-CHECKING; REACHABILITY; SMODELS SYSTEMS; STABLE MODEL; STABLE MODEL SEMANTICS;

AUTOMATA THEORY; LOGIC PROGRAMMING; MODEL CHECKING; PETRI NETS; SEMANTICS; TEMPORAL LOGIC;

PROBLEM SOLVING;

EID: 84867767739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_15     Document Type: Conference Paper

References (17)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), pages 193-207. Springer, March 1999.
2. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
4. J. C. Corbett. Evaluating deadlock detection methods for concurrent software. Technical report, Department of Information and Computer Science, University of Hawaii at Manoa, 1995.
5. J. Desel and W. Reisig. Place/Transition Petri nets. In Lectures on Petri Nets I: Basic Models, pages 122-173. Springer-Verlag, 1998.
6. J. Esparza. Decidability and complexity of Petri net problems - An introduction. In Lectures on Petri Nets I: Basic Models, pages 374-428. Springer-Verlag, 1998.
7. F. Fages. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
8. 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.
9. K. Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae, 37(3):247-268, 1999.
10. K. Heljanko. Bounded reachability checking with process semantics. In Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001), Aalborg, Denmark, August 2001. Accepted for publication.
11. K. Heljanko and I. Niemelä. Answer set programming and bounded model checking. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 90-96, Stanford, USA, March 2001. AAAI Press, Technical Report SS-01-01.
12. G. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
13. O. Kupferman and M. Y. Vardi. Model checking of safety properties. In Proceeding of 11th International Conference on Computer Aided Verification (CAV'99), pages 172-183. Springer-Verlag, 1999.
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.
15. I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3, 4):241-273, 1999.
16. I. Niemelä and P. Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491-521. Kluwer Academic Publishers, 2000.
17. K. Varpaaniemi, K. Heljanko, and J. Lilius. PROD 3.2 - An advanced tool for efficient reachability analysis. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV'97), pages 472-475, Haifa, Israel, June 1997. Springer-Verlag.