Robust Computation Tree Logic

by   Satya Prakash Nayak, et al.

It is widely accepted that every system should be robust in that "small" violations of environment assumptions should lead to "small" violations of system guarantees, but it is less clear how to make this intuition mathematically precise. While significant efforts have been devoted to providing notions of robustness for Linear Temporal Logic (LTL), branching-time logic, such as Computation Tree Logic (CTL) and CTL*, have received less attention in this regard. To address this shortcoming, we develop "robust" extensions of CTL and CTL*, which we name robust CTL (rCTL) and robust CTL* (rCTL*). Both extensions are syntactically similar to their parent logics but employ multi-valued semantics to distinguish between "large" and "small" violations of the specification. We show that the multi-valued semantics of rCTL make it more expressive than CTL, while rCTL* is as expressive as CTL*. Moreover, we devise efficient model checking algorithms for rCTL and rCTL*, which have the same asymptotic time complexity as the model checking algorithms for CTL and CTL*, respectively.



There are no comments yet.


page 1

page 2

page 3

page 4


Asynchronous Extensions of HyperLTL

Hyperproperties are a modern specification paradigm that extends trace p...

Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity

We study the expressivity and the model checking problem of linear tempo...

From Quantified CTL to QBF

QCTL extends the temporal logic CTL with quantifications over atomic pro...

Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison

In the last years, model checking with interval temporal logics is emerg...

The theory of concatenation over finite models

We propose FC, a logic on words that combines the previous approaches of...

Temporal Logic and Model Checking for Operator Precedence Languages

In the last decades much research effort has been devoted to extending t...

"Most of" leads to undecidability: Failure of adding frequencies to LTL

Linear Temporal Logic (LTL) interpreted on finite traces is a robust spe...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.