Parametric Systems: Verification and Synthesis

In this paper we study possibilities of using hierarchical reasoning, symbol elimination and model generation for the verification of parametric systems, where the parameters can be constants or functions. Our goal is to automatically provide guarantees that such systems satisfy certain safety or invariance conditions. We analyze the possibility of automatically generating such guarantees in the form of constraints on parameters. We illustrate our methods on several examples

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2019

On Invariant Synthesis for Parametric Systems

We study possibilities for automated invariant generation in parametric ...
research
07/06/2021

Symbol Elimination for Parametric Second-Order Entailment Problems (with Applications to Problems in Wireless Network Theory)

We analyze possibilities of second-order quantifier elimination for form...
research
07/01/2019

Parametric Verification: An Introduction

This paper constitutes a short introduction to parametric verification o...
research
08/16/2019

How to Win First-Order Safety Games

First-order (FO) transition systems have recently attracted attention fo...
research
01/04/2012

Sciduction: Combining Induction, Deduction, and Structure for Verification and Synthesis

Even with impressive advances in automated formal methods, certain probl...
research
03/18/2019

Parametric schedulability analysis of a launcher flight control system under reactivity constraints

The next generation of space systems will have to achieve more and more ...
research
04/05/2018

Incremental Verification of Parametric and Reconfigurable Markov Chains

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

Please sign up or login with your details

Forgot password? Click here to reset