Approximating ATL* in ATL
- 10 April 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 289-301
- https://doi.org/10.1007/3-540-47813-2_20
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Alternating-time temporal logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Proving feature non-interaction with Alternating-Time Temporal LogicPublished by Springer Science and Business Media LLC ,2001
- Efficient Büchi Automata from LTL FormulaeLecture Notes in Computer Science, 2000
- Patterns in property specifications for finite-state verificationPublished by Association for Computing Machinery (ACM) ,1999
- CTL+ Is Exponentially More Succinct than CTLLecture Notes in Computer Science, 1999
- Decision procedures and expressiveness in the temporal logic of branching timeJournal of Computer and System Sciences, 1985
- "Sometime" is sometimes "not never"Published by Association for Computing Machinery (ACM) ,1980