A benchmark library for parametric timed model checking

12/20/2018
by   André Étienne, et al.
0

Verification of real-time systems involving hard timing constraints and concurrency is of utmost importance. Parametric timed model checking allows for formal verification in the presence of unknown timing constants or uncertainty (e.g. imprecision for periods). With the recent development of several techniques and tools to improve the efficiency of parametric timed model checking, there is a growing need for proper benchmarks to test and compare fairly these tools. We present here a benchmark library for parametric timed model checking made of benchmarks accumulated over the years. Our benchmarks include academic benchmarks, industrial case studies and examples unsolvable using existing techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2020

Automatic Verification of LLVM Code

In this work we present our work in developing a software verification t...
research
11/23/2018

Automated Verification of Stand-alone Solar Photovoltaic Systems

With declining costs and increasing performance, the deployment of renew...
research
11/27/2018

AsmetaF: A Flattener for the ASMETA Framework

Abstract State Machines (ASMs) have shown to be a suitable high-level sp...
research
12/21/2018

Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking

The election of a leader in a network is a challenging task, especially ...
research
11/04/2021

A thread-safe Term Library

Terms are one of the fundamental data structures for computing. E.g. eve...
research
12/30/2020

Visual counterexample explanation for model checking with Oeritte

Despite being one of the most reliable approaches for ensuring system co...
research
06/18/2021

A Benchmarks Library for Extended Parametric Timed Automata

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

Please sign up or login with your details

Forgot password? Click here to reset