ATL{sup}* Satisfiability Is 2EXPTIME-Complete

摘要

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{sup}*, 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{sup}* is a notable exception of this rule: Both ATL{sup}* model checking and ATL{sup}* satisfiability checking are 2EXPTIME-complete.