Practical applications of the alternating cycle decomposition

DOI10.1007/978-3-030-99527-0_6MaRDI QIDQ6535610zbMATH OpenFDO

Authors Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin, Salomon Sickert

Publication date 1 February 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-99527-0_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Practical “Paritizing” of Emerson-Lei Automata
• Symbolic Implementation of Alternating Automata
• Alternation removal in Büchi automata
• Alternating weak automata from universal trees
• Weak alternating automata are not that weak

Cites work

• An automata-theoretic approach to linear temporal logic
• Automata, logics, and infinite games. A guide to current research
• Computing the Rabin Index of a Parity Automaton
• From LTL and limit-deterministic Büchi automata to deterministic parity automata
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1302170 (Why is no real title available?)
• scientific article; zbMATH DE number 1973991 (Why is no real title available?)
• scientific article; zbMATH DE number 1500643 (Why is no real title available?)
• scientific article; zbMATH DE number 1555955 (Why is no real title available?)
• scientific article; zbMATH DE number 1796123 (Why is no real title available?)
• Index appearance record for transforming Rabin automata into parity automata
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• One theorem to rule them all: a unified translation of LTL into -automata
• Owl: a library for \(\omega \)-words, automata, and LTL
• Practical synthesis of reactive systems from LTL specifications via parity games
• Practical “Paritizing” of Emerson-Lei Automata

Cited in

(5)

• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
• Symbolic solution of Emerson-Lei games for reactive synthesis
• Tighter construction of tight Büchi automata
• Efficient normalization of linear temporal logic
• The complexity of simplifying -automata through the alternating cycle decomposition

This page was built for publication: Practical applications of the alternating cycle decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535610)