10 citations · 44 across the 15 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2024
Execution-time opacity problems in one-clock parametric timed automata
Étienne André, Johan Arcile, Engel Lefaucheux
Parametric timed automata (PTAs) extend the concept of timed automata, by allowing timing delays not only specified by concrete values but also by parameters, allowing the analysis…
cs.FL2022
The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Wojciech Czerwiński, Engel Lefaucheux, Filip Mazowiecki +2
We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of…