20 citations · 21 across the 4 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2013
Emptiness and Universality Problems in Timed Automata with Positive Frequency
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye +1
The languages of infinite timed words accepted by timed automata are traditionally defined using Buchi-like conditions. These acceptance conditions focus on the set of locations vi…
cs.FL2012★ 20 cited
Off-line test selection with test purposes for non-deterministic timed automata
Nathalie Bertrand, Thierry Jéron, Amélie Stainer +1
This article proposes novel off-line test generation techniques from non-deterministic timed automata with inputs and outputs (TAIOs) in the formal framework of the tioco conforman…