Recurrent Reachability Analysis in Regular Model Checking

DOI10.1007/978-3-540-89439-1_15MaRDI QIDQ5505554zbMATH OpenOpenAlexFDO

Authors Anthony Widjaja To, Leonid Libkin

Publication date 27 January 2009

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/17832717/Widjaja_To_Lobkin_2008_Recurrent_Reachability_Analysis_in_Regular_Model_Checking.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Reachability problems on regular ground tree rewriting graphs
• Tree regular model checking: a simulation-based approach
• scientific article; zbMATH DE number 1670791
• Tools and Algorithms for the Construction and Analysis of Systems
• Regular model checking using inference of regular languages

Cited in

(8)

• Reachability problems on regular ground tree rewriting graphs
• Accelerating tree-automatic relations
• Model Checking FO(R) over One-Counter Processes and beyond
• Monadic decomposability of regular relations
• Reachability Analysis with State-Compatible Automata
• Tree-automatic well-founded trees
• Ramsey quantifiers over automatic structures: complexity and applications to verification
• Regular model checking for systems with effectively regular reachability relation

This page was built for publication: Recurrent Reachability Analysis in Regular Model Checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505554)