Search

• < Previous
• 1
• Next >

---

Quantified CTL: Expressiveness and Complexity

François Laroussinie ; Nicolas Markey.

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its&nbsp;[&hellip;]

---

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;]

---