Simulation relations for alternating Büchi automata

DOI10.1016/J.TCS.2005.01.015MaRDI QIDQ557801zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

alternating automataautomata minimizationsimulation relationquotientingBüchi automataBüchi games

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)

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

Cites work

• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 2043528 (Why is no real title available?)
• scientific article; zbMATH DE number 1927582 (Why is no real title available?)
• scientific article; zbMATH DE number 1927583 (Why is no real title available?)
• scientific article; zbMATH DE number 1754628 (Why is no real title available?)
• scientific article; zbMATH DE number 1754629 (Why is no real title available?)
• scientific article; zbMATH DE number 1759624 (Why is no real title available?)
• scientific article; zbMATH DE number 1903362 (Why is no real title available?)
• An attack on a recursive authentication protocol. A cautionary tale
• An attack on the Needham-Schroeder public-key authentication protocol
• Deciding the security of protocols with commuting public key encryption
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• On the security of public key protocols
• Using encryption for authentication in large networks of computers

Cited in

(14)

• scientific article; zbMATH DE number 1954381 (Why is no real title available?)
• Enhancing Simulation for Checking Language Containment
• Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
• scientific article; zbMATH DE number 1754630 (Why is no real title available?)
• Büchi automata can have smaller quotients
• Multi-buffer simulations: decidability and complexity
• Multipebble simulations for alternating automata (extended abstract)
• Mediating for reduction (on minimizing alternating Büchi automata)
• Multi-buffer simulations for trace language inclusion
• 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

Describes a project that uses

Uses Software

• LTL2BA

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)