Log In Sign Up

Parametric Verification: An Introduction

by   Étienne André, et al.

This paper constitutes a short introduction to parametric verification of concurrent systems. It originates from two 1-day tutorial sessions held at the Petri nets conferences in Toruń (2016) and Zaragoza (2017). The 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. We first introduce motivation behind parametric verification in general, and then focus on different models and approaches, for verifying several kinds of systems. They include Parametric Timed Automata, for modelling real-time systems, where the timing constraints are not necessarily known a priori. Similarly, Parametric Interval Markov Chains allow for modelling systems where probabilities of events occurrences are intervals with parametric bounds. Parametric Petri Nets allow for compact representation of systems, and cope with different types of parameters. Finally, Action Synthesis aims at enabling or disabling actions in a concurrent system to guarantee some of its properties. Some tools implementing these approaches were used during hands-on sessions at the tutorial. The corresponding practicals are freely available on the Web.


page 18

page 27

page 28


Formalizing Time4sys using parametric timed automata

Critical real-time systems must be verified to avoid the risk of dramati...

Efficient Convex Zone Merging in Parametric Timed Automata

Parametric timed automata are a powerful formalism for reasoning on conc...

A Verification Framework for Component-Based Modeling and Simulation Putting the pieces together

In this thesis a comprehensive verification framework is proposed to con...

Parametric Systems: Verification and Synthesis

In this paper we study possibilities of using hierarchical reasoning, sy...

Incremental Verification of Parametric and Reconfigurable Markov Chains

The analysis of parametrised systems is a growing field in verification,...

A Benchmarks Library for Extended Parametric Timed Automata

Parametric timed automata are a powerful formalism for reasoning on conc...

Non-Sequential Theory of Distributed Systems

These lecture notes cover basic automata-theoretic concepts and logical ...