Simulation relations for alternating Büchi automata
DOI10.1016/J.TCS.2005.01.015zbMATH Open1078.68082OpenAlexW2013689938MaRDI QIDQ557801FDOQ557801
Authors: Carsten Fritz, Thomas Wilke 
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.015
Recommendations
- Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata
- Simulation Relations for Alternating Parity Automata and Parity Games
- Simulation algorithms for symbolic automata
- Multipebble simulations for alternating automata (extended abstract)
- scientific article; zbMATH DE number 1954381
- Congruence Relations for Büchi Automata
- scientific article; zbMATH DE number 56675
- Complementation of Büchi Automata Using Alternation
- Publication:3033341
- Bisimulation relations for weighted automata
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- An attack on a recursive authentication protocol. A cautionary tale
- Using encryption for authentication in large networks of computers
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the security of public key protocols
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- An attack on the Needham-Schroeder public-key authentication protocol
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding the security of protocols with commuting public key encryption
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Title not available (Why is that?)
- Enhancing Simulation for Checking Language Containment
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Title not available (Why is that?)
- Büchi automata can have smaller quotients
- Multipebble simulations for alternating automata (extended abstract)
- Multi-buffer simulations: decidability and complexity
- Multi-buffer simulations for trace language inclusion
- Mediating for reduction (on minimizing alternating Büchi automata)
- Mediating for reduction (on minimizing alternating Büchi automata)
- Topological characterisation of multi-buffer simulation
- Ramsey-based inclusion checking for visibly pushdown automata
- Simulations in rank-based Büchi automata complementation
- Simulation Relations for Alternating Parity Automata and Parity Games
Uses Software
This page was built for publication: Simulation relations for alternating Büchi automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557801)
