Tree regular model checking: a simulation-based approach

DOI10.1016/J.JLAP.2006.02.001MaRDI QIDQ2500700zbMATH OpenOpenAlexFDO

Authors Parosh A. Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine

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

simulationtransducerrewrite systemssemi-algorithmtree regular model checking

Mathematics Subject Classification ID

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

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• Algorithmic improvements in regular model checking.
• Abstract regular tree model checking
• On (omega-)regular model checking
• scientific article; zbMATH DE number 1927558

Cites work

• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 1306878 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 2081102 (Why is no real title available?)
• scientific article; zbMATH DE number 1796140 (Why is no real title available?)
• scientific article; zbMATH DE number 1903379 (Why is no real title available?)
• scientific article; zbMATH DE number 1903380 (Why is no real title available?)
• Algorithmic improvements in regular model checking.
• Automata-theoretic techniques for modal logics of programs
• CONCUR 2004 - Concurrency Theory
• Computer Aided Verification
• Computer Aided Verification
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Handling liveness properties in (\(\omega\)-)regular model checking
• Iterating transducers in the large (extended abstract)
• Partial-order reduction in symbolic state-space exploration
• Regular model checking using inference of regular languages
• Symbolic model checking with rich assertional languages
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(21)

• Computing Simulations over Tree Automata
• scientific article; zbMATH DE number 1903380 (Why is no real title available?)
• Tools and Algorithms for the Construction and Analysis of Systems
• A completion algorithm for lattice tree automata
• scientific article; zbMATH DE number 1903379 (Why is no real title available?)
• Parametric real-time model checking using splitting trees
• On (omega-)regular model checking
• Tools and Algorithms for the Construction and Analysis of Systems
• Approximation-based tree regular model-checking
• Equational approximations for tree automata completion
• Recurrent Reachability Analysis in Regular Model Checking
• Accelerating tree-automatic relations
• BISIMULATION MINIMIZATION OF TREE AUTOMATA
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Algorithmic improvements in regular model checking.
• A congruence-based perspective on finite tree automata
• scientific article; zbMATH DE number 1538041 (Why is no real title available?)
• scientific article; zbMATH DE number 1796140 (Why is no real title available?)
• Logical characterizations of simulation and bisimulation for fuzzy transition systems
• COMPOSED BISIMULATION FOR TREE AUTOMATA
• Abstract regular tree model checking

This page was built for publication: Tree regular model checking: a simulation-based approach

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