Simulation relations for alternating Büchi automata

DOI10.1016/j.tcs.2005.01.015zbMath1078.68082OpenAlexW2013689938MaRDI QIDQ557801

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

zbMATH Keywords

Büchi automataalternating automataautomata minimizationsimulation relationBüchi gamesquotienting

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata ⋮ Unnamed Item ⋮ Büchi Automata Can Have Smaller Quotients ⋮ Multi-buffer simulations: decidability and complexity ⋮ Mediating for reduction (on minimizing alternating Büchi automata) ⋮ Topological Characterisation of Multi-Buffer Simulation

Uses Software

• LTL2BA

Cites Work

• An attack on a recursive authentication protocol. A cautionary tale
• An attack on the Needham-Schroeder public-key authentication protocol
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item