Reachability on prefix-recognizable graphs

Authors:
Stefan Göller
Affiliations:
Institut für Informatik, Universität Leipzig, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 9
Cited 1

Alternation

Journal of the ACM (JACM)
On infinite transition graphs having a decidable monadic theory

Theoretical Computer Science
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Iterated pushdown automata and complexity classes

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Prefix-recognizable graphs and monadic logic

Automata logics, and infinite games
Reachability Problems on Regular Ground Tree Rewriting Graphs

Theory of Computing Systems
Symbolic backwards-reachability analysis for higher-order pushdown systems

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Parity games played on transition graphs of one-counter processes

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability.