Parametric Verification: An Introduction

07/01/2019
by   Étienne André, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 18

page 27

page 28

05/23/2019

Formalizing Time4sys using parametric timed automata

Critical real-time systems must be verified to avoid the risk of dramati...
10/11/2019

Parametric Systems: Verification and Synthesis

In this paper we study possibilities of using hierarchical reasoning, sy...
07/03/2019

What's decidable about parametric timed automata?

Parametric timed automata (PTAs) are a powerful formalism to reason, sim...
06/18/2021

A Benchmarks Library for Extended Parametric Timed Automata

Parametric timed automata are a powerful formalism for reasoning on conc...
04/05/2018

Incremental Verification of Parametric and Reconfigurable Markov Chains

The analysis of parametrised systems is a growing field in verification,...
04/27/2021

Temporal Reasoning Through Automatic Translation of tock-CSP into Timed Automata

In this work, we consider translating tock-CSP into Timed Automata for U...
06/11/2020

Petri Nets with Parameterised Data: Modelling and Verification (Extended Version)

During the last decade, various approaches have been put forward to inte...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.