Search

• < Previous
• 1
• Next >

---

Language Preservation Problems in Parametric Timed Automata

Étienne André ; Didier Lime ; Nicolas Markey.

Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valuation, does there exist another parameter&nbsp;[&hellip;]

---

Reachability and liveness in parametric timed automata

Étienne André ; Didier Lime ; Olivier H. Roux.

We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable. Notably, the parametric reachability emptiness problem, i.e., the emptiness of the&nbsp;[&hellip;]

---

Parametric updates in parametric timed automata

Étienne André ; Didier Lime ; Mathias Ramparison.

We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters. We focus here on the EF-emptiness problem: "is the set of parameter valuations for which some given location is&nbsp;[&hellip;]

---