On ACTL formulas having linear counterexamples

Journal of Computer and System Sciences

Volumn 62, Issue 3, 2001, Pages 463-515

  Buccafurri, Francesco ^a   Eiter, Thomas ^b   Gottlob, Georg ^b   Leone, Nicola ^c  

^a UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF CALABRIA   (Italy)

Author keywords

ACTL; Branching time logics; Counterexamples; Counterpaths; Linear counterexamples; Model checking; Temporal reasoning; Verification

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; LINEARIZATION; MAXIMUM PRINCIPLE; POLYNOMIALS; SET THEORY; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

BRANCHING TIME LOGICS; COMPUTATIONAL TREE LOGIC; POLYNOMIAL TIME; TRANSITION GRAPH;

COMPUTATIONAL METHODS;

EID: 0035339587     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1734     Document Type: Article

References (12)

1. F. Buccafurri, T. Eiter, G. Gottlob, and N. Leone, Enhancing model checking in verification by AI techniques, Artificial Intelligence 112 (1999), 57-104.
2. E. Clarke and E. Emerson, Skeletons for branching time temporal logic, in "Logic in Programs: Workshop Proceedings," Lecture Notes in Computer Science, Vol. 131, Springer-Verlag, Berlin/New York, 1981.
3. E. Clarke, E. Emerson, and A. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Trans. Programming Languages 8 (1996), 244-263.
4. E. Clarke, O. Grumberg, and D. Long, Verification tools for finite-state concurrent systems, in "A Decade of Concurrency-Reflections and Perspectives" (J. de Bakker, W. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 803, pp. 124-175, Springer-Verlag, Berlin/New York, 1994.
5. E. Clarke, O. Grumberg, K. McMillan, and K. Zhao, Efficient generation of counterexamples and witnesses in symbolic model checking, in "Proc. 32nd ACM/SIGDA Design Automation Conference 1995 (DAC '95)," ACM Press, New York, 1994. [Also Technical Report CMU-CS-94-204, Carnegie Mellon University, Pittsburgh, PA, 1994.]
6. E. Clarke, O. Grumberg, and D. Long, Model checking, in "Deductive Program Design" (M. Broy, Ed.), Vol. 152, Springer-Verlag, Berlin/New York, 1996.
7. E. Emerson, Temporal and modal logics, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, Chap. 16, Elsevier Science, North-Holland, Amsterdam, 1990.
8. M. Garey and D. S. Johnson, "Computers and Intractability - A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
9. R. Hojati, R. K. Brayton, and R. P. Kurshan, BDD-based debugging of design using language containment and fair CTL, in "Proceedings 7th International Conference on Computer Aided Verification (CAV '95), Elounda, Greece, 1993," Lecture Notes in Computer Science, Vol. 697, pp. 41-58, Springer-Verlag, Berlin/New York.
10. O. Kupferman and M. Y. Vardi, "An Automata-Theoretic Approach to Modular Model Checking," manuscript based on LICS '95 and CONCUR '95 abstracts, 1998, submitted for publication.
11. K. McMillan, "Symbolic Model Checking," Kluwer, Dordrecht, 1993.
12. R. Milner, "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ, 1993.