Accelerating tree-automatic relations

DOI10.4230/LIPICS.FSTTCS.2012.313MaRDI QIDQ2957509zbMATH OpenOpenAlexFDO

Authors Anthony Widjaja Lin

Publication date 26 January 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2012/3869/pdf/30.pdf

zbMATH Keywords

model checkingautomatainfinite systemssemi-algorithm

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

• Tree regular model checking: a simulation-based approach
• Tools and Algorithms for the Construction and Analysis of Systems
• Recurrent Reachability Analysis in Regular Model Checking
• An Automata Theoretic Approach to Rational Tree Relations
• Computing Simulations over Tree Automata

Cited in

(3)

• Fair termination for parameterized probabilistic concurrent systems
• Regular model checking revisited
• Ramsey quantifiers over automatic structures: complexity and applications to verification

This page was built for publication: Accelerating tree-automatic relations

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