André, Étienne and Lime, Didier and Markey, Nicolas - Language Preservation Problems in Parametric Timed Automata

lmcs:4700 - Logical Methods in Computer Science, January 22, 2020, Volume 16, Issue 1 - https://doi.org/10.23638/LMCS-16(1:5)2020
Language Preservation Problems in Parametric Timed Automata

Authors: André, Étienne and Lime, Didier and Markey, Nicolas

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 valuation with the same untimed language, or with the same set of traces? We show that these problems are undecidable both for general PTA and for the restricted class of L/U-PTA, even for integer-valued parameters, or over bounded time. On the other hand, we exhibit decidable subclasses: 1-clock PTA, and 1-parameter deterministic L-PTA and U-PTA. We also consider robust versions of these problems, where we additionally require that the language be preserved for all valuations between the reference valuation and the new valuation.


Volume: Volume 16, Issue 1
Published on: January 22, 2020
Submitted on: July 20, 2018
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 203 times.
This article's PDF has been downloaded 123 times.