Apr 20, 2020 · In this paper, we first study reachability. We exhibit a subclass of PTAs (namely integer-points PTAs) with bounded rational-valued parameters ...
Feb 9, 2022 · Abstract. We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical ...
scholar.google.com › citations
This paper exhibits a subclass of PTAs with bounded rational-valued parameters for which the parametric reachability emptiness problem is decidable, ...
In this paper, we first study reachability. We exhibit a subclass of PTAs (namely integer-points PTAs) with bounded rational-valued parameters for which the ...
Apr 20, 2020 · Parametric timed automata (PTAs) allow to reason on systems featuring concurrency and timing constraints making use of parameters. Most problems ...
Lower-bound/upper-bound parametric timed automata (L/U-PTAs) achieve decidability for reachability properties by enforcing a separation of parameters used ...
Abstract—We study timed systems in which some timing fea- tures are unknown parameters. Parametric timed automata are a classical formalism for such systems ...
Aug 25, 2022 · This problem of control state reachability in timed automata was posed in [Alur and Dill 1994] and is known to be PSPACE-complete.
Jan 20, 2024 · Here, we focus on reachability objectives, which require a strategy for the controller to schedule controllable actions such that — no matter ...
Lower-bound/upper-bound parametric timed automata (L/U-PTAs) achieve decidability for reachability properties by enforcing a separation of parameters used ...