Approximate Automata for Omega-Regular Languages

DOI10.1007/978-3-030-31784-3_19zbMath1437.68095arXiv2012.14590OpenAlexW3114817139MaRDI QIDQ3297599

Hazem Torfah, Rayna Dimitrova, Bernd Finkbeiner

Publication date: 20 July 2020

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.14590

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Certifying inexpressibility

Uses Software

• LTL2BA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of Reactive(1) designs
• Automaticity. I: Properties of a measure of descriptional complexity
• Determinising Parity Automata
• Bounded Synthesis
• Structural complexity of ω-automata
• Fixing the State Budget: Approximation of Regular Languages with Small DFAs
• Why These Automata Types?
• Ultimately periodic words of rational ω-languages
• Bounded model checking using satisfiability solving
• Synthesizing approximate implementations for unrealizable specifications