DeepAI AI Chat
Log In Sign Up

Timed Automata Robustness Analysis via Model Checking

by   Jaroslav Bendik, et al.

Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification. However, the exact timing constants are often uncertain during the design phase. Consequently, the designer is often able to build a TA with a correct structure, however, the timing constants need to be tuned to satisfy the specification. Moreover, even if the TA initially satisfies the specification, it can be the case that just a slight perturbation during the implementation causes a violation of the specification. Unfortunately, model-checking tools are usually not able to provide any reasonable guidance on how to fix the model in such situations. In this paper, we propose several concepts and techniques to cope with the above mentioned design phase issues when dealing with reachability and safety specifications.


page 1

page 2

page 3

page 4


Efficient Black-Box Checking via Model Checking with Strengthened Specifications

Black-box checking (BBC) is a testing method for cyber-physical systems ...

Linear-Time Model Checking Branching Processes

(Multi-type) branching processes are a natural and well-studied model fo...

Timed I/O Automata: It is never too late to complete your timed specification theory

A specification theory combines notions of specifications and implementa...

Visual Analysis of Hyperproperties for Understanding Model Checking Results

Model checkers provide algorithms for proving that a mathematical model ...

Offline timed pattern matching under uncertainty

Given a log and a specification, timed pattern matching aims at exhibiti...

Exemplifying parametric timed specifications over signals with bounded behavior

Specifying properties can be challenging work. In this paper, we propose...

Checking Timed Bisimulation with Bounded Zone-History Graphs – Technical Report

Timed automata (TA) are a well-established formalism for discrete-state/...