Add to ORKGion for Parametric Timed Automata (Abstract) B'eatrice B'erard and Laurent Fribourg ? Ecole Normale Sup'erieure Cachan/CNRS - 61 av. Pdt. Wilson - 94235 Cachan - France email: fberard,fribourgg@lsv.ens-cachan.fr Abstract. We present here a method for performing backward reachability analysis of Alur-Dill's timed automata, which is inspired from Revesz's procedure for computing least fixed-points of logic programs with arithmetical constraints. The method extends to timed automata which use parameters instead of constants within clock constraints. In order to guarantee the termination of the procedure in this case, we perform an abstraction of the reachability relation, and the procedure does not yield any longer th...
International audienceWe consider in this paper systems modeled by timed automata. The timing bounds...
Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed...
This is the author (and slightly extended) version of the manuscript of the same name published in t...
International audienceParametric reasoning is particularly relevant for timed models, but very often...
This is the author version of the manuscript of the same name published in the proceedings of the 24...
Abstract. The synthesis of timing parameters consists in deriving con-ditions on the timing constant...
Abstract. We study the decidability and complexity of the reachability problem in parametric timed a...
This paper presents a rewriting logic semantics for parametric timed automata (PTAs) and shows that ...
International audienceThe synthesis of timing parameters consists in deriving conditions on the timi...
This is the author version of the manuscript of the same name published in the International Journal...
This is the author version of the paper of the same name published in the proceedings of the 25th In...
We study timed systems in which some timing features are unknown parameters.Parametric timed automat...
International audienceInterrupt Timed Automata (ITA) are an expressive timed model, introduced to ta...
Abstract. We deal with a parametric version of timed game automata (PGA), where clocks can be compar...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
International audienceWe consider in this paper systems modeled by timed automata. The timing bounds...
Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed...
This is the author (and slightly extended) version of the manuscript of the same name published in t...
International audienceParametric reasoning is particularly relevant for timed models, but very often...
This is the author version of the manuscript of the same name published in the proceedings of the 24...
Abstract. The synthesis of timing parameters consists in deriving con-ditions on the timing constant...
Abstract. We study the decidability and complexity of the reachability problem in parametric timed a...
This paper presents a rewriting logic semantics for parametric timed automata (PTAs) and shows that ...
International audienceThe synthesis of timing parameters consists in deriving conditions on the timi...
This is the author version of the manuscript of the same name published in the International Journal...
This is the author version of the paper of the same name published in the proceedings of the 25th In...
We study timed systems in which some timing features are unknown parameters.Parametric timed automat...
International audienceInterrupt Timed Automata (ITA) are an expressive timed model, introduced to ta...
Abstract. We deal with a parametric version of timed game automata (PGA), where clocks can be compar...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
International audienceWe consider in this paper systems modeled by timed automata. The timing bounds...
Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed...
This is the author (and slightly extended) version of the manuscript of the same name published in t...