Add to ORKGA number of approaches exists that permit to synthesize the operational state-based behavior of a set of components for a set of scenarios. In this paper we explore how to extend these approaches to also tackle the problem for scenarios with parametric timing constraints in form of upper and lower time bounds. The resulting time consistency problems are identi-fied and ideas for an algorithmic handling are presented. 1
Abstract—We provide a subclass of parametric timed au-tomata (PTA) that we can actually and efficien...
Traditional approaches to the algorithmic verification of real-time systems are limited to checking...
International audienceAbstract Real-time systems are notoriously hard to verify due to nondeterminis...
Scenarios as partial behavior descriptions, are used more and more to represent users requirements, ...
International audienceWe consider in this paper systems modeled by timed automata. The timing bounds...
This is the author version of the paper of the same name published in the proceedings of the 25th In...
Specifying properties can be challenging work. In this paper, we propose an automated approach to ex...
This is the author version of the manuscript of the same name published in the International Journal...
International audienceSpecifying properties can be challenging work.In this paper, we propose an aut...
This is the author version of the manuscript of the same name published in the proceedings of the 24...
Abstract. The paper shows how bounded model checking can be ap-plied to parameter synthesis for para...
. Traditional approaches to the algorithmic verification of real-time systems are limited to checkin...
. In this work we tackle the following problem: given a timed automaton, and a target set F of confi...
Abstract. The synthesis of timing parameters consists in deriving con-ditions on the timing constant...
International audienceThe synthesis of timing parameters consists in deriving conditions on the timi...
Abstract—We provide a subclass of parametric timed au-tomata (PTA) that we can actually and efficien...
Traditional approaches to the algorithmic verification of real-time systems are limited to checking...
International audienceAbstract Real-time systems are notoriously hard to verify due to nondeterminis...
Scenarios as partial behavior descriptions, are used more and more to represent users requirements, ...
International audienceWe consider in this paper systems modeled by timed automata. The timing bounds...
This is the author version of the paper of the same name published in the proceedings of the 25th In...
Specifying properties can be challenging work. In this paper, we propose an automated approach to ex...
This is the author version of the manuscript of the same name published in the International Journal...
International audienceSpecifying properties can be challenging work.In this paper, we propose an aut...
This is the author version of the manuscript of the same name published in the proceedings of the 24...
Abstract. The paper shows how bounded model checking can be ap-plied to parameter synthesis for para...
. Traditional approaches to the algorithmic verification of real-time systems are limited to checkin...
. In this work we tackle the following problem: given a timed automaton, and a target set F of confi...
Abstract. The synthesis of timing parameters consists in deriving con-ditions on the timing constant...
International audienceThe synthesis of timing parameters consists in deriving conditions on the timi...
Abstract—We provide a subclass of parametric timed au-tomata (PTA) that we can actually and efficien...
Traditional approaches to the algorithmic verification of real-time systems are limited to checking...
International audienceAbstract Real-time systems are notoriously hard to verify due to nondeterminis...