Skip to Main content Skip to Navigation
Conference papers

SAT-Based Minimization of Deterministic ω-Automata

Abstract : We describe a tool that inputs a deterministic ω-automaton with any acceptance condition, and synthesizes an equivalent ω-automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal ω-automata equivalent to given properties, for different acceptance conditions.
Document type :
Conference papers
Complete list of metadata
Contributor : souheib baarir Connect in order to contact the contributor
Submitted on : Wednesday, February 8, 2017 - 10:13:35 PM
Last modification on : Tuesday, November 16, 2021 - 4:17:14 AM



Souheib Baarir, Alexandre Duret-Lutz. SAT-Based Minimization of Deterministic ω-Automata. Logic for Programming, Artificial Intelligence, and Reasoning, Nov 2015, Suva, Fiji. pp.79--87, ⟨10.1007/978-3-662-48899-7_6⟩. ⟨hal-01462805⟩



Record views