Preprint
Sep 2026
Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor
This paper adapts the formalism of simple elementary languages (sEL) and introduces the timed augmented prefix tree acceptor (tAPTA), and generates a deterministic timed automaton (DTA) consistent with a given set of system behaviors.
Zi-Ran Wang, Jie An, Nai-Jun Zhan
· 0 citations