Model checking LTL using constraint programming

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

Volumn 1248, Issue , 1997, Pages 1-20

  Esparza, Javier ^a   Melzer, Stephan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; PETRI NETS; TEMPORAL LOGIC;

AUTOMATA-THEORETIC APPROACH; CASE-STUDIES; CONSTRAINT PROGRAMMING; MODEL CHECKING PROBLEM; T-INVARIANT;

MODEL CHECKING;

EID: 84958970010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63139-9_26     Document Type: Conference Paper

References (17)

1. Eike Best, Raymond Devillers, and Jon G. Hall. The Box Calculus: a New Causal Algebra with Multi-Label Communication. Number 4/92 in Hildesheimer Informatik-Bericht. Universität Hildesheim, Mai 1992.
2. 2 - a Basic Petri Net Programming Notation. In A. Bode, M. Reeve, and G. Wolf, editors, Proceedings of PARLE '93, volume 694 of Lecture Notes in Computer Science, pages 379-390, 1993.
3. Luc Bouge. Repeated Synchronous Snapshots and their Implementation in CSP. In W. Brauer, editor, Proceedings 12th ICALP, volume 194 of Lecture Notes in Computer Science, pages 63-70. Springer, 1981.
4. Ernest Chang and Rosemary Roberts. An Improved Algorithm for Decentralised Extrema-finding in Circular Distributed Systems. Communication of the ACM, 22(5):281-283, 1979.
5. Jörg Desel and Javier Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
6. J. Esparza and S. Melzer. Model-Checking LTL using Constraint Programming. Technical report, Technische Universität München, March 1997. Available at http://papa.informatik.tu-muenchen.de/forschung/sfb342_a3/refs.html.
7. Javier Esparza and Glenn Bruns. Trapping Mutual Exclusion in the Box Calculus. Theoretical Computer Science, 153:95-128, 1996.
8. Rob Gerth, Doron Peled, Moshe Vardi, and Pierre Wolper. Simple On-the-fly Automatic Verification of Linear Temporal Logic. In Protocol Specification Testing and Verification, pages 3-18, Warsaw, Poland, 1995. Chapman & Hall.
9. Patrice Godefroid. Partial-Order Methods for Verification of Concurrent Systems, volume 1032 of Lecture Notes in Computer Science. Springer, 1996.
10. Bernd Grahlman and Eike Best. PEP - More than a Petri Net Tool. In T. Margaria and B. Steffen, editors, TAGAS '96, volume 1055 of Lecture Notes in Computer Science, pages 397-401. Springer-Verlag, 1996.
11. Gerald J. Holzmann. Basic Spin Manual. AT&T Bell Lab., Murray Hill.
12. Joxan Jaffar and Jean-Lois Lassez. Constraint logic programming. In 14th Annual ACM Symposium on Principles of Programming Languages, 1987.
13. Ken McAloon and Carol Tretkoff. Optimization and Computational Logic. John Wiley & Sons, 1996.
14. Antti Valmari, A Stubborn Attack on State Explosion. Formal Methods in System Design, 1:297-322, 1992.
15. M. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.
16. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logics in Computer Science, pages 322-331, Cambridge, June 1986.
17. F. Wallner. Model-Checking LTL using Net Unfoldings. Technical report, Technische Universität München, Institut für Informatik, Forthcoming 1997.