Reachability Preservation Based Parameter Synthesis for Timed Automata

  title={Reachability Preservation Based Parameter Synthesis for Timed Automata},
  author={{\'E}tienne Andr{\'e} and Giuseppe Lipari and Hoang Gia Nguyen and Youcheng Sun},
The synthesis of timing parameters consists in deriving conditions on the timing constants of a concurrent system such that it meets its specification. Parametric timed automata are a powerful formalism for parameter synthesis, although most problems are undecidable. We first address here the following reachability preservation problem: given a reference parameter valuation and a (bad) control state, do there exist other parameter valuations that reach this control state iff the reference… 

Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction

This work proposes a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs.

Learning-Based Compositional Parameter Synthesis for Event-Recording Automata

This work proposes a method to compute an abstraction of the non-parametric set of components so as to improve the verification of reachability properties in the full (parametric) system.

Timed Automata Robustness Analysis via Model Checking

This paper proposes several concepts and techniques to cope with the above mentioned design phase issues when dealing with reachability and safety specifications.

Timed Automata Relaxation for Reachability

A novel concept of a minimal sufficient reduction (MSR) is proposed that allows us to identify the minimal set S of timing constraints of the TA that needs to be tuned to meet the specification.

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

This paper describes here the new features and algorithms offered by  3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.

Refinement of Trace Abstraction for Real-Time Programs

A semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs is proposed.

Efficient Parametric Verification of Parametric Timed Automata

This thesis introduces an algorithm to detect non-Zeno runs and its distributed version of it for large-scale models and introduces several smart state exploration techniques with some heuristics, in order to reduce the state space explosion.

Enhanced Distributed Behavioral Cartography of Parametric Timed Automata

Enhanced distributed algorithms to compute the cartography efficiently are presented and Experimental results show that the new algorithms significantly outperform previous distribution techniques.

Parametric Verification: An Introduction

This paper presents not only the basic formal concepts tackled in the video version, but also an extensive literature to provide the reader with further references covering the area, to introduce motivation behind parametric verification in general and focus on different models and approaches for verifying several kinds of systems.

1 J ul 2 01 9 Parametric Verification : An Introduction ⋆

This paper first introduces motivation behind parametric verification in general, and then focuses on different models and approaches, for verifying several kinds of systems, including Parametric Timed Automata, for modelling real-time systems, where the timing constraints are not necessarily known a priori.



Synthesis of Timing Parameters Satisfying Safety Properties

These algorithms based on the inverse method for parametric timed automata are presented, which are significantly quicker, synthesize larger sets of parameter valuations than the original method, and still preserve various properties including safety (i.e., non-reachability) properties.

Integer Parameter Synthesis for Timed Automata

This work provides a subclass of parametric timed automata (PTA) that it is argued that it retains most of the practical usefulness of PTA, and shows that the problem of the existence of parameter values such that some TCTL property is satisfied is PSPACE-complete.

Linear parametric model checking of timed automata

An Inverse Method for Parametric Timed Automata

Symbolic Computation of Schedulability Regions Using Parametric Timed Automata

This paper proposes a novel and general method, based on parametric timed automata, for symbolically computing the region in the parameter's space that guarantees a feasible schedule, given a set of real-time tasks characterised by aSet of parameters and by an activation pattern.

Parametric real-time reasoning

This work addresses the more realistic and more ambitious problem of deriving symbolic constraints on the timing properties required of real-time systems by introducing parametric timed automata whose transitions are constrained with parametric timing requirements.

Distributed Behavioral Cartography of Timed Automata

An attempt to distribute a synthesis algorithm, the behavioral cartography, and the parallelization of two work distribution algorithms are proposed, which gives promising results and opens perspectives toward verification of larger models.

Decision Problems for Lower/Upper Bound Parametric Timed Automata

It is shown that basic decision problems, such as emptiness, finiteness and universality of the set of parameter valuations for which there is a corresponding infinite accepting run of the automaton, is Pspace-complete.

Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction

It is shown that in general Buchi emptiness is not preserved under this abstraction, but some other structural properties are preserved, and a variation of the classical nested depth-first search (ndfs) algorithm that exploits subsumption is proposed.

Timed verification of the generic architecture of a memory circuit using parametric timed automata

Using a variant of Clariso-Cortadella’s parametric method for verifying asynchronous circuits, some crucial timing behaviors of the architecture of SPSMALL memory are analysed and a set of linear constraints that ensure the correctness of the response times of the memory are derived.