A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
On the Power of Automata Minimization in Reactive Synthesis
2021
Electronic Proceedings in Theoretical Computer Science
Temporal logic is often used to describe temporal properties in AI applications. The most popular language for doing so is Linear Temporal Logic (LTL). Recently, LTL on finite traces, LTL f , has been investigated in several contexts. In order to reason about LTL f , formulas are typically compiled into deterministic finite automata (DFA), as the intermediate semantic representation. Moreover, due to the fact that DFAs have canonical representation, efficient minimization algorithms can be
doi:10.4204/eptcs.346.8
fatcat:65vawwmkczdkda35dzjl43jfnq