On the expressive power of invariants in parametric timed automata

08/19/2019
by   Étienne André, et al.
0

The verification of systems combining hard timing constraints with concurrency is challenging. This challenge becomes even harder when some timing constants are missing or unknown. Parametric timed formalisms, such as parametric timed automata (PTAs), tackle the synthesis of such timing constants (seen as parameters) for which a property holds. Such formalisms are highly expressive, but also undecidable, and few decidable subclasses were proposed. We propose here a syntactic restriction on PTAs consisting in removing guards (constraints on transitions) to keep only invariants (constraints on locations). While this restriction preserves the expressiveness of PTAs (and therefore their undecidability), an additional restriction on the type of constraints allows to not only prove decidability, but also to perform the exact synthesis of parameter valuations satisfying reachability. This formalism, that seems trivial at first sight as it benefits from the decidability of the reachability problem with a better complexity than Timed Automata (TAs), suffers from the undecidability of the whole TCTL logic that TAs, on the contrary enjoy. We believe our formalism allows for an interesting trade-off between decidability and practical expressiveness and is therefore promising. We show its applicability in a small case study.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2020

Reachability and liveness in parametric timed automata

We study timed systems in which some timing features are unknown paramet...
research
10/19/2020

Parametric non-interference in timed automata

We consider a notion of non-interference for timed automata (TAs) that a...
research
06/07/2022

Timed automata as a formalism for expressing security: A survey on theory and practice

Timed automata are a common formalism for the verification of concurrent...
research
03/24/2022

Zone extrapolations in parametric timed automata

Timed automata (TAs) are an efficient formalism to model and verify syst...
research
11/29/2018

Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics

Parametric models abstract part of the specification of dynamical models...
research
12/09/2022

Efficient Convex Zone Merging in Parametric Timed Automata

Parametric timed automata are a powerful formalism for reasoning on conc...
research
07/13/2020

Complexity of Verification and Synthesis of Threshold Automata

Threshold automata are a formalism for modeling and analyzing fault-tole...

Please sign up or login with your details

Forgot password? Click here to reset