Approximating ATL* in ATL

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

Volumn 2294 LNCS, Issue , 2002, Pages 289-301

  Harding, Aidan ^a   Ryan, Mark ^a   Schobbens, Pierre Yves ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; TEMPORAL LOGIC; FORMAL LOGIC;

ALTERNATING TIME TEMPORAL LOGIC; CASE-STUDIES; LINEAR TIME; PARALLEL COMPOSITION; TOOL SUPPORT;

MODEL CHECKING;

EID: 84894631199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47813-2_20     Document Type: Conference Paper

References (12)

1. R. Alur, T. A. Henzinger, S. C. Krishnan, et al. Mocha User Manual. Computer and Information Science Department, University of Pennsylvania and Electrical Engineering and Computer Sciences Department, University of California, Nov. 1999.
2. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 100-109. IEEE Computer Society Press, 1997.
3. F. Cassez, M. D. Ryan, and P.-Y. Schobbens. Proving feature non-interaction with alternating-time temporal logic. In S. Gilmore and M. D. Ryan, editors, Language Constructs for Describing Features. Springer-Verlag, 2000.
4. M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Patterns in property specifications for finite-state verification. In Proceedings of the 21st International Conference on Software Engineering, May 1999.
5. E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30(1):1-25, Feb. 1985.
6. L. Lamport. "Sometimes" is sometimes "not never"-on the temporal logic of programs. In Proc. 7th ACM Symposium on Principles of Programming Languages, pages 174-185, Jan. 1980.
7. L. Lamport. What good is temporal logic? In R. E. A. Mason, editor, Proceedings of the IFIP Congress on Information Processing, pages 657-667. North-Holland, 1983.
8. T. Laureys. From event based semantics to linear temporal logic. Master's thesis, School of Cognitive Science-University of Edinburgh, 2 Buccleuch Place, Edinburgh, UK, 1999.
9. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Proceedings of 10th International Conference on Computer Aided Verification, pages 248-263. Springer-Verlag, 2000.
10. Mocha. http://www-cad.eecs.berkeley.edu/~tah/mocha/.
11. SMV. http://www-cad.eecs.berkeley.edu/~kenmcmil/smv/.
12. T. Wilke. CTL+ is exponentially more succinct than CTL. In C. P. R. et al., editor, Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 1738 of Lecture Notes in Computer Science, pages 110-121. Springer Verlag, 1999.