Abstract: 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'n (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.
Recommendations
Cited in
(6)- scientific article; zbMATH DE number 7577576 (Why is no real title available?)
- Automatizing parametric reasoning on distributed concurrent systems
- On completeness of liveness synthesis for parametric timed automata (Extended Abstract)
- Parametric model checking with VerICS
- Learning-based compositional parameter synthesis for event-recording automata
- Timed automata relaxation for reachability
This page was built for publication: Parametric verification: an introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032913)
