Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Reasoning about infinite computations
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Model checking the full modal mu-calculus for infinite sequential processes
Theoretical Computer Science
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Composition, decomposition and model checking of pushdown processes
Nordic Journal of Computing
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Model-Checking LTL with Regular Valuations for Pushdown Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model Checking for Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Benefits of Bounded Model Checking at an Industrial Setting
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Model Checking: From Tools to Theory
25 Years of Model Checking
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An automata-theoretic approach to infinite-state systems
Time for verification
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Hi-index | 0.00 |
We develop an automata-theoretic framework for reasoning about linear properties of infinite-state sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisfies a temporal property can then be done by an alternating two-way automaton that navigates through the tree. We introduce path automata on trees. The input to a path automaton is a tree, but the automaton cannot split to copies and it can read only a single path of the tree. In particular, two-way nondeterministic path automata enable exactly the type of navigation that is required in order to check linear properties of infinite-state sequential systems.We demonstrate the versatility of the automata-theoretic approach by solving several versions of the model-checking problem for LTL specifications and prefix-recognizable systems. Our algorithm is exponential in both the size of (the description of) the system and the size of the LTL specification, and we prove a matching lower bound. This is the first optimal algorithm for solving the LTL model-checking problem for prefix recognizable systems. Our framework also handles systems with regular labeling.