1 citations · 1 across the 12 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2019
On the Distance between Timed Automata
Amnon Rosenmann
The problem of inclusion of the language accepted by timed automaton (e.g., the implementation) in the language accepted by (e.g., the specification) is, in general, undeci…
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…
cs.FL2014
The Timestamp of Timed Automata
Amnon Rosenmann
Given a member A of the class of non-deterministic timed automata with silent transitions (eNTA), we effectively compute its timestamp: the set of all pairs (time value, action) of…