An Automata-Theoretic Approach to Branching-Time Model Checking

Orna Kupferman, Moshe Y. Vardi, Pierre Wolper

Research output: Contribution to journalArticlepeer-review

400 Scopus citations

Abstract

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty, making them essentially useless for model-checking. Recently, Bernholtz and Grumberg [1993] have shown that this exponential penalty can be avoided, though they did not match the linear complexity of non-automata-theoretic algorithms. In this paper, we show that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics. Not only can they be used to obtain optimal decision procedures, as was shown by Muller et al., but, as we show here, they also make it possible to derive optimal model-checking algorithms. Moreover, the simple combinatorial structure that emerges from the automata-theoretic approach opens up new possibilities for the implementation of branching-time model checking, and has enabled us to derive improved space complexity bounds for this long-standing problem.

Original languageAmerican English
Pages (from-to)312-360
Number of pages49
JournalJournal of the ACM
Volume47
Issue number2
DOIs
StatePublished - 2000

Fingerprint

Dive into the research topics of 'An Automata-Theoretic Approach to Branching-Time Model Checking'. Together they form a unique fingerprint.

Cite this