Expressiveness and succinctness of a logic of robustness
From MaRDI portal
Publication:4586143
DOI10.1080/11663081.2015.1050907zbMath1400.68137OpenAlexW2252821131MaRDI QIDQ4586143
John C. McCabe-Dansted, Sophie Pinchinat, M. A. Reynolds, Tim French
Publication date: 12 September 2018
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.2015.1050907
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logics in computer science. A study on extensions of temporal and strategic logics
- A tableau-based decision procedure for CTL\(^*\)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- Reasoning about infinite computations
- A logic for reasoning about time and reliability
- Games for synthesis of controllers with partial observation.
- A resource logic for multi-agent plan merging
- Automata, logics, and infinite games. A guide to current research
- Alternative semantics for temporal logics
- A Rooted Tableau for BCTL*
- A complete axiomatization of a temporal logic with obligation and robustness
- dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification
- On the Hybrid Extension of CTL and CTL +
- A Temporal Logic of Robustness
- A Tableau for RoBCTL
- The Complexity of Enriched Mu-Calculi
- Robust normative systems and a logic of norm compliance
- Bounded-Variable Fragments of Hybrid Logics
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Deciding full branching time logic
- “Sometimes” and “not never” revisited
- The Complexity of Tree Automata and Logics of Programs
- AI 2003: Advances in Artificial Intelligence
- Model Checking Propositional Deontic Temporal Logic via a μ-Calculus Characterization
- Robust Analysis of Timed Automata Via Channel Machines
- A Decision Procedure for CTL* Based on Tableaux and Automata
- Deontic Logic in Computer Science
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
