Computing Simulations over Tree Automata

DOI10.1007/978-3-540-78800-3_8zbMath1134.68391OpenAlexW1685060813MaRDI QIDQ5458323

Lukáš Holík, Ahmed Bouajjani, Tomáš Vojnar, Lisa Kaati, Parosh Aziz Abdulla

Publication date: 11 April 2008

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_8

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)

Related Items

Simulation relations for pattern matching in directed graphs, Unnamed Item, Forest automata for verification of heap manipulation, An efficient simulation algorithm on Kripke structures, Nested antichains for WS1S, A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, Multi-buffer simulations: decidability and complexity, Computing Simulations over Tree Automata, Mediating for reduction (on minimizing alternating Büchi automata), Topological Characterisation of Multi-Buffer Simulation, Automata on infinite trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree regular model checking: a simulation-based approach
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Three Partition Refinement Algorithms
• Computing Simulations over Tree Automata
• Bisimulation Minimization of Tree Automata