Verifying linear temporal specifications of constant-rate multi-mode systems

04/26/2023
by   Michael Blondin, et al.
0

Constant-rate multi-mode systems (MMS) are hybrid systems with finitely many modes and real-valued variables that evolve over continuous time according to mode-specific constant rates. We introduce a variant of linear temporal logic (LTL) for MMS, and we investigate the complexity of the model-checking problem for syntactic fragments of LTL. We obtain a complexity landscape where each fragment is either P-complete, NP-complete or undecidable. These results generalize and unify several results on MMS and continuous counter systems.

READ FULL TEXT
research
04/17/2020

Verification of Continuous-time Markov Chains

In this paper, we fill the long-standing gap in the field of the verific...
research
06/17/2019

Statistical Verification of Hyperproperties for Cyber-Physical System

Many important properties of cyber-physical systems (CPS) are defined up...
research
05/02/2021

Model Checking Quantum Continuous-Time Markov Chains

Verifying quantum systems has attracted a lot of interests in the last d...
research
05/02/2022

On verifying expectations and observations of intelligent agents

Public observation logic (POL) is a variant of dynamic epistemic logic t...
research
02/11/2022

Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains

Verifying quantum systems has attracted a lot of interest in the last de...
research
10/07/2021

On the Complexity of Inductively Learning Guarded Rules

We investigate the computational complexity of mining guarded clauses fr...
research
12/23/2019

Simulation under Arbitrary Temporal Logic Constraints

Most model checkers provide a useful simulation mode, that allows users ...

Please sign up or login with your details

Forgot password? Click here to reset