Search

• < Previous
• 1
• Next >

Language Preservation Problems in Parametric Timed Automata

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