Turning game models turn-based for model checking properties of agents

Belgian/Netherlands Artificial Intelligence Conference

Volumn , Issue , 2005, Pages 143-150

  Jamroga, Wojeieeh ^a   Dix, Jürgcn ^a  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING TRANSITION SYSTEM; COMPUTATIONAL SYSTEM; GAME MODELS; NONDETERMINISTIC POLYNOMIAL; NP COMPLETE; POLYNOMIAL-TIME; TRANSITION SYSTEM;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; SEMANTICS;

MODEL CHECKING;

EID: 38949188411     PISSN: 15687805     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. R. Alur and T. A. Heninger. Reactive modules. Formal Methods in System Design, 15(1):7-48, 1999.
2. R. Alur, T. A. Henzingor, and O. Kupferman. Alternating-time Temporal Logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pages 100-109. IEEE Computer Society Press, 1997.
3. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time Temporal Logic. Lecture Notes in Computer Science, 1536:23-60, 1998.
4. R. Alur. T. A. Heninger, and O. Kupferman. Alternating-time Temporal Logic. Journal of the ACM, 49:672-713, 2002.
5. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publishers, 1990.
6. 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-24, 1985.
7. V. Goranko and W. Jamroga. Comparing semantics of logics for multi-agent systems. Synthase, 139(2):241-280, 2004.
8. YV. Jamroga and J. Dix. Do agents make model checking explode (computationally)? In M. Pechoucek, P. Petta, and L.Z. Varga, editors, Proceedings of CEEMAS 2005, volume 3690 of Lecture Notes in Computer Science, pages 398-407. Springer Verlag, 2005.
9. W. Jamroga and J. Dix. Model checking strategic abilities of agents under incomplete information. In Proceedings of ICTCS 2005, Lecture Notes in Computer Science. Springer Verlag, 2005. To appear.
10. F. Laroussinio, N. Markey, and Ph. Schnoebelen. Model checking CTL+ and FCTL is hard. In Proceedings of FaSSaCS'01, volume 2030 of Lecture Notes in Computer Science, pages 318-331. Springer, 2001.
11. P. Y. Schobbens. Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science, 85(2), 2004.
12. W. van der Hoek. Formal comment on W. Jamroga's paper. Presented at FAMAS'03, 2003.
13. YV. van der Hoek and M. Wooldridge. Cooperation, knowledge and time: Alternating-time Temporal Epistemic Logic and its applications. Studia Logica, 75(1):125-157, 2003.