Tree regular model checking: a simulation-based approach

DOI10.1016/j.jlap.2006.02.001zbMath1101.68055OpenAlexW2091043802MaRDI QIDQ2500700

Ahmed Rezine, Axel Legay, Parosh Aziz Abdulla, Julien d'Orso

Publication date: 17 August 2006

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2006.02.001

zbMATH Keywords

simulationrewrite systemstransducersemi-algorithmtree regular model checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items

BISIMULATION MINIMIZATION OF TREE AUTOMATA, Logical characterizations of simulation and bisimulation for fuzzy transition systems, Equational approximations for tree automata completion, Computing Simulations over Tree Automata, COMPOSED BISIMULATION FOR TREE AUTOMATA, A Congruence-Based Perspective on Finite Tree Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata-theoretic techniques for modal logics of programs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• CONCUR 2004 - Concurrency Theory
• Computer Aided Verification
• Computer Aided Verification
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• Computer Aided Verification
• Symbolic model checking with rich assertional languages
• Partial-order reduction in symbolic state-space exploration