Satisfiability and finite model property for the alternating-time µ-calculus

Authors:
Sven Schewe;Bernd Finkbeiner
Affiliations:
Universität des Saarlandes, Saarbrücken, Germany;Universität des Saarlandes, Saarbrücken, Germany
Venue:
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Year:
2006

Citing 14
Cited 8

Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reasoning about infinite computations

Information and Computation
Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra

Theoretical Computer Science
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Automata on Infinite Objects and Church's Problem

Automata on Infinite Objects and Church's Problem
Alternating-time temporal logic

Journal of the ACM (JACM)
µ-Calculus Synthesis

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Small Progress Measures for Solving Parity Games

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
MOCHA: Modularity in Model Checking

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Decision Procedure for the Propositional µ-Calculus

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
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
Uniform Distributed Synthesis

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

ATL* Satisfiability Is 2EXPTIME-Complete

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Tighter Bounds for the Determinisation of Büchi Automata

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
A generic constructive solution for concurrent games with expressive constraints on strategies

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Distributed synthesis for alternating-time logics

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Solving parity games in big steps

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Coordination logic

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a decision procedure for the alternating-time μ-calculus. The algorithm is based on a representation of alternating-time formulas as automata over concurrent game structures. We show that language emptiness of these automata can be checked in exponential time. The complexity of our construction meets the known lower bounds for deciding the satisfiability of the classic μ-calculus. It follows that the satisfiability problem is EXPTIME-complete for the alternating-time μ-calculus.