Robust Alternating-Time Temporal Logic

Murano, Aniello; Neider, Daniel; Zimmermann, Martin

doi:10.1007/978-3-031-43619-2_54

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Book1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Robust Alternating-Time Temporal Logic

Murano,

Neider,

Zimmermann

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Robust Alternating-Time Temporal Logic

Murano,

Neider,

Zimmermann

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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

Robust Alternating-Time Temporal Logic

Cited by 2 publications

References 44 publications

Robust Alternating-Time Temporal Logic

Robust Alternating-Time Temporal Logic

Robust computation tree logic

Contact Info

Product

Resources

About