Sublogics of a branching time logic of robustness

McCabe-Dansted, John Christopher; Dixon, Clare; French, Tim; Reynolds, Mark

doi:10.1016/j.ic.2019.02.003

Cited by 2 publications

(1 citation statement)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…New Formalisms and Logical Methods. These range across novel temporal logics [12,13], multi-modal logics [14][15][16][17][18][19], spatial logics [20], formalisms for complex reasoning [21], and refined proof methods [22] (the proof methods often concern clausal resolution techniques). These developments together provide a formal basis for our specification and reasoning across a range of practical agent-based, distributed, or autonomous systems.…”

Section: Specification and Verificationmentioning

confidence: 99%

Verifiable autonomy: From theory to applications

Dennis

Dixon

Fisher

2022

AIC

Self Cite

View full text Add to dashboard Cite

The Autonomy and Verification group11 Part of a wider, international, Autonomy and Verification Network of activity: https://autonomy-and-verification.github.io sits within the Department of Computer Science22 https://www.cs.manchester.ac.uk at the University of Manchester. The group has a long history of research into agents and multi-agent systems (both at Manchester and, previously, at the University of Liverpool) particularly in the areas of formal specification and verification, multi-agent programming, ethical agent reasoning, and swarms, teams and organisations.

show abstract

Section: Specification and Verificationmentioning

confidence: 99%

Verifiable autonomy: From theory to applications

Dennis

Dixon

Fisher

2022

AIC

Self Cite

View full text Add to dashboard Cite

show abstract

Robust computation tree logic

Nayak,

Neider,

Roy

et al. 2024

Innovations Syst Softw Eng

View full text Add to dashboard Cite

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, branching-time logics, 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 show that the model checking problem, the satisfiability problem, and the synthesis problem for rCTL and rCTL* have the same asymptotic complexity as their non-robust counterparts, implying that robustness can be added to branching-time logics for free.

show abstract

Sublogics of a branching time logic of robustness

Cited by 2 publications

References 38 publications

Verifiable autonomy: From theory to applications

Verifiable autonomy: From theory to applications

Robust computation tree logic

Contact Info

Product

Resources

About