Searching for "Minimizable Timed Automata." – sorted by Relevance.
-
Folk theorems on the determinization and minimization of timed automata
- . Also, minimizable timed automata (MTA) are introduced in [12]. In an MTA, clocks have bounded time
- Cited by 4 (1 self) – Add To MetaCart

