Synthesis of Timing Parameters Satisfying Safety Properties

  title={Synthesis of Timing Parameters Satisfying Safety Properties},
  author={{\'E}tienne Andr{\'e} and Romain Soulat},
Safety properties are crucial when verifying real-time concurrent systems. When reasoning parametrically, i.e., with unknown constants, it is of high interest to infer a set of parameter valuations consistent with such safety properties. We present here algorithms based on the inverse method for parametric timed automata: given a reference parameter valuation, it infers a constraint such that, for any valuation satisfying this constraint, the discrete behavior of the system is the same as under… 

Reachability Preservation Based Parameter Synthesis for Timed Automata

A procedure is introduced that can efficiently replace the behavioral cartography to partition a bounded parameter subspace into good and bad subparts and outperform the classical bad-state driven parameter synthesis semi-algorithm, especially when distributed on a cluster.

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.

Parameter synthesis for hierarchical concurrent real-time systems

This work presents Parametric Stateful Timed Communicating Sequential Processes, a language capable of specifying and verifying parametric hierarchical real-time systems with complex data structures and presents several semi-algorithms for efficient parameter synthesis.

Merge and Conquer: State Merging in Parametric Timed Automata

A state merging reduction based on convex union, that reduces the state space, but yields an over-approximation of the executable paths, but it is shown that it preserves the sets of reachable locations and executable actions.

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.

Preserving Partial Order Runs in Parametric Time Petri Nets

This paper uses partial order semantics for parametric time Petri nets as a way to significantly enhance the result of an existing synthesis algorithm for parameter synthesis for timed systems.

Parameter Synthesis Through Temporal Logic Specifications

This paper proposes an algorithm for parameter synthesis w.r.t. a property specified using the considered logic, which exploits reachable set computations and forward refinements and illustrates it on an epidemic model.

Enhancing the Inverse Method with State Merging

It is shown that the integration of merging into IM leads to the synthesis of larger zones around π0, which often improves the performance of IM, both in terms of computational space and time.

Timed Orchestration for Component-based Systems

This work formalizes the problem of configuring and orchestrating flexible production lines as a parameter synthesis problem for systems of parametric timed automata, where interactions are based on skills and provides a set of computationally cheap over-approximations of the set of reachable states for constraint generation.

Certifying Emptiness of Timed Büchi Automata

An approach for extracting certificates for the emptiness of timed Buchi automata from model checking runs and can be double checked by a certifier that is formally verify in Isabelle/HOL.



An Inverse Method for Parametric Timed Automata

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.

An inverse method for the synthesis of timing parameters in concurrent systems. (Une méthode inverse pour la synthèse de paramètres temporels dans les systèmes concurrents)

A novel approach for the synthesis of delays for timed systems, in particular in the framework of timed automata, a model for verifying real-time systems, relies on the following inverse method: given a reference valuation of the parameters, a constraint on the parameters is synthesized, guaranteeing the same timeabstract linear behavior as for the reference valuation.

An extension of the inverse method to probabilistic timed automata

A method for obtaining automatically a constraint K0 on timing parameters for which the reachability probabilities (1) remain invariant and (2) are equal to the reachable probabilities for the reference valuation is presented.

Linear parametric model checking of timed automata

Bounded Model Checking for Parametric Timed Automata

This paper shows how bounded model checking can be applied to parameter synthesis for parametric timed automata with continuous time, and presents an implementation for the existential part of CTL−X.

IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata

We present here Imitator II, a new version of Imitator, a tool implementing the "inverse method" for parametric timed automata: given a reference valuation of the parameters, it synthesizes a

A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata

This work proposes an adaptation of counterexample-guided abstraction refinement (CEGAR) with which one can obtain an underapproximation of the set of good parameters using linear programming and identifies a syntactic condition for which the approach is complete.

Parameterized Reachability Analysis of the IEEE 1394 Root Contention Protocol using TReX

The reachability analysis of fully parametrized models of the IEEE 1394 root contention protocol, using the symbolic reachability techniques implemented in the TReX tool to synthesize automatically all the relations already found by proof or experiments on the unparameterized versions.

A Temporal Logic of Nested Calls and Returns

This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.