Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Process algebra
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Undecidable verification problems for programs with unreliable channels
Information and Computation
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
The regular viewpoint on PA-processes
Theoretical Computer Science
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model-Checking Infinite Systems Generated by Ground Tree Rewriting
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Reachability Problems on Regular Ground Tree Rewriting Graphs
Theory of Computing Systems
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Handling Liveness Properties in (ω-)Regular Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable first-order transition logics for PA-processes
Information and Computation
Size and computation of injective tree automatic presentations
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Model checking EGF on basic parallel processes
ATVA'11 Proceedings of the 9th 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
Tree-Automatic well-founded trees
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Hi-index | 0.00 |
We consider the problem of recurrent reachability over infinite systems given by regular relations on words and trees, i.e, whether a given regular set of states can be reached infinitely often from a given initial state in the given transition system. Under the condition that the transitive closure of the transition relation is regular, we show that the problem is decidable, and the set of all initial states satisfying the property is regular. Moreover, our algorithm constructs an automaton for this set in polynomial time, assuming that a transducer of the transitive closure can be computed in poly-time. We then demonstrate that transition systems generated by pushdown systems, regular ground tree rewrite systems, and the well-known process algebra PA satisfy our condition and transducers for their transitive closures can be computed in poly-time. Our result also implies that model checking EF-logic extended by recurrent reachability predicate (EGF) over such systems is decidable.