Robust Computation Tree Logic

01/18/2022
by   Satya Prakash Nayak, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2023

Robust Alternating-Time Temporal Logic

In multi-agent system design, a crucial aspect is to ensure robustness, ...
research
10/07/2020

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

We study the expressivity and the model checking problem of linear tempo...
research
06/09/2023

Robust Probabilistic Temporal Logics

We robustify PCTL and PCTL*, the most important specification languages ...
research
06/24/2019

From Quantified CTL to QBF

QCTL extends the temporal logic CTL with quantifications over atomic pro...
research
02/26/2023

Strategic (Timed) Computation Tree Logic

We define extensions of CTL and TCTL with strategic operators, called St...
research
09/10/2018

Temporal Logic and Model Checking for Operator Precedence Languages

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

The theory of concatenation over finite models

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

Please sign up or login with your details

Forgot password? Click here to reset