Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of theoretical computer science (vol. B)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Alternating-time temporal logic
Journal of the ACM (JACM)
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Satisfiability in Alternating-time Temporal Logic
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Synthesis of communicating processes from temporal logic specifications
Synthesis of communicating processes from temporal logic specifications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Satisfiability and finite model property for the alternating-time µ-calculus
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Relentful strategic reasoning in alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Alternating interval based temporal logics
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Comparing variants of strategic ability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
The two central decision problems that arise during the design of safety critical systems are the satisfiability and the model checking problem. While model checking can only be applied after implementing the system, satisfiability checking answers the question whether a system that satisfies the specification exists. Model checking is traditionally considered to be the simpler problem --- for branching-time and fixed point logics such as CTL, CTL*, ATL, and the classical and alternating time μ-calculus, the complexity of satisfiability checking is considerably higher than the model checking complexity. We show that ATL* is a notable exception of this rule: Both ATL* model checking and ATL* satisfiability checking are 2EXPTIME-complete.