Tree regular model checking: a simulation-based approach

DOI10.1016/J.JLAP.2006.02.001zbMATH Open1101.68055OpenAlexW2091043802MaRDI QIDQ2500700FDOQ2500700

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

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

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)

Cites Work

• Iterating transducers in the large (extended abstract)
• Title not available (Why is that?)
• Automata-theoretic techniques for modal logics of programs
• Tools and Algorithms for the Construction and Analysis of Systems
• Title not available (Why is that?)
• Computer Aided Verification
• Computer Aided Verification
• Symbolic model checking with rich assertional languages
• Title not available (Why is that?)
• Partial-order reduction in symbolic state-space exploration
• Regular model checking using inference of regular languages
• Handling liveness properties in (\(\omega\)-)regular model checking
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• CONCUR 2004 - Concurrency Theory
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Algorithmic improvements in regular model checking.
• Title not available (Why is that?)

Cited In (21)

• A completion algorithm for lattice tree automata
• Title not available (Why is that?)
• 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
• Algorithmic improvements in regular model checking.
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• A congruence-based perspective on finite tree automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• COMPOSED BISIMULATION FOR TREE AUTOMATA
• Abstract regular tree model checking
• Logical characterizations of simulation and bisimulation for fuzzy transition systems
• Computing Simulations over Tree Automata
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems

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)