Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Quantitative temporal reasoning
Real-Time Systems
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Real-time symbolic model checking for discrete time models
Theories and experiences for real-time system development
Model checking
Alternating-time temporal logic
Journal of the ACM (JACM)
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
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
Efficient timed model checking for discrete-time systems
Theoretical Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Measuring Permissivity in Finite Games
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model checking probabilistic timed automata with one or two clocks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.01 |
We extend the framework of ATL model-checking to “simply timed” concurrent game structures, i.e., multi-agent structures where each transition carry an integral duration (or interval thereof). While the case of single durations is easily handled from the semantics point of view, intervals of durations raise several interesting questions. Moreover subtle algorithmic problems have to be handled when dealing with model checking. We propose a semantics for which we develop efficient (PTIME) algorithms for timed ATL without equality constraints, while the general case is shown to be EXPTIME-complete.