10 citations · 23 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2023★ 1 cited
Timed I/O Automata: It is never too late to complete your timed specification theory
Martijn A. Goorden, Kim G. Larsen, Axel Legay +3
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design.…
cs.FL2015★ 1 cited
Bounded Determinization of Timed Automata with Silent Transitions
Florian Lorber, Amnon Rosenmann, Dejan Nickovic +1
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a conseq…