Dissecting \texttt{ltlsynt}

DOI10.1007/s10703-022-00407-6OpenAlexW4384300979MaRDI QIDQ6151759

Alexandre Duret-Lutz, Florian Renkin, Philipp Schlehuber-Caissier, Adrien Pommellet

Publication date: 11 March 2024

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-022-00407-6

zbMATH Keywords

parity gamesreactive synthesisparity automataMealy machinesLTL formulas

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Efficient minimization of deterministic weak \(\omega\)-automata
• Modalities for model checking: Branching time logic strikes back
• Effective reductions of Mealy machines
• An Improved Construction of Deterministic Omega-automaton Using Derivatives
• Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
• Graph-Based Algorithms for Boolean Function Manipulation
• State Reduction in Incompletely Specified Finite-State Machines
• One Theorem to Rule Them All
• Mathematical Foundations of Computer Science 2003