Computing Simulations over Tree Automata
DOI10.1007/978-3-540-78800-3_8zbMATH Open1134.68391OpenAlexW1685060813MaRDI QIDQ5458323FDOQ5458323
Lukáš Holik, Ahmed Bouajjani, Tomáš Vojnar, Lisa Kaati, Parosh A. 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
Recommendations
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)
Cites Work
- Three Partition Refinement Algorithms
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Abstract regular tree model checking
- Computing Simulations over Tree Automata
- Title not available (Why is that?)
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Tree regular model checking: a simulation-based approach
- Bisimulation Minimization of Tree Automata
- Title not available (Why is that?)
Cited In (14)
- Nested antichains for WS1S
- Title not available (Why is that?)
- Topological Characterisation of Multi-Buffer Simulation
- Automata on infinite trees
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
- Simulation algorithms for symbolic automata
- An efficient simulation algorithm on Kripke structures
- Multi-buffer simulations: decidability and complexity
- Mediating for reduction (on minimizing alternating Büchi automata)
- Composed Bisimulation for Tree Automata
- Forest automata for verification of heap manipulation
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- Simulation relations for pattern matching in directed graphs
- Computing Simulations over Tree Automata
This page was built for publication: Computing Simulations over Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458323)
