Handbook of theoretical computer science (vol. B)
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Journal of the ACM (JACM)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Alternating-time temporal logic
Journal of the ACM (JACM)
Dynamical Properties of Timed Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
NUSMV: A New Symbolic Model Verifier
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Liveness in Timed and Untimed Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Timed alternating-time temporal logic
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A new algorithm for strategy synthesis in LTL games
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Hi-index | 0.00 |
We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are "more concurrent", in the sense that they always allow all the agents to act on the system, independently of the delay they want to elapse before their action. Timed CGSs weaken the "element of surprise" of timed game automata reported by de Alfaro et al. We prove that our model has nice properties, in particular that modelchecking timed CGSs against timed ATL is decidable via region abstraction, and in particular that strategies are "region-stable" if winning objectives are. We also propose a new extension of TATL, containing ATL*, which we call TALTL. We prove that model-checking this logic remains decidable on timed CGSs. Last, we explain how our algorithms can be adapted in order to rule out Zeno (co-)strategies, based on the ideas of Henzinger et al.