This is an overview of the invited talk delivered at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016)
Augmented version with proofsInternational audienceTimed automata are a convenient mathematical mode...
Weighted timed games are zero-sum games played by two players on a timedautomaton equipped with weig...
AbstractProbabilistic timed automata are a suitable formalism to model systems with real-time, nonde...
Abstract. In this paper, we study timed games played on weighted timed automata. In this context, th...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
International audienceWeighted timed games are played by two players on a timed automaton equipped w...
In a reachability-time game, players Min and Max choose moves so that the time to reach a final stat...
A weighted timed game is a timed game with extra quantitative information representing e.g. energy c...
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automa...
AbstractIn this paper, we present weighted/priced timed automata, an extension of timed automaton wi...
Abstract. We propose a method to synthesise optimal values of timing parameters for probabilistic ti...
Reachability checking is one of the most basic problems in verification. By solving this problem in ...
Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterminis...
Reachability checking is one of the most basic problems in verification. By solving this problem in ...
Augmented version with proofsInternational audienceTimed automata are a convenient mathematical mode...
Weighted timed games are zero-sum games played by two players on a timedautomaton equipped with weig...
AbstractProbabilistic timed automata are a suitable formalism to model systems with real-time, nonde...
Abstract. In this paper, we study timed games played on weighted timed automata. In this context, th...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
International audienceWeighted timed games are played by two players on a timed automaton equipped w...
In a reachability-time game, players Min and Max choose moves so that the time to reach a final stat...
A weighted timed game is a timed game with extra quantitative information representing e.g. energy c...
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automa...
AbstractIn this paper, we present weighted/priced timed automata, an extension of timed automaton wi...
Abstract. We propose a method to synthesise optimal values of timing parameters for probabilistic ti...
Reachability checking is one of the most basic problems in verification. By solving this problem in ...
Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterminis...
Reachability checking is one of the most basic problems in verification. By solving this problem in ...
Augmented version with proofsInternational audienceTimed automata are a convenient mathematical mode...
Weighted timed games are zero-sum games played by two players on a timedautomaton equipped with weig...
AbstractProbabilistic timed automata are a suitable formalism to model systems with real-time, nonde...
DOI
Add to ORKG