Sublogics of a branching time logic of robustness
From MaRDI portal
Publication:1740655
DOI10.1016/j.ic.2019.02.003zbMath1436.03125OpenAlexW2919677696MaRDI QIDQ1740655
Tim French, Clare Dixon, John C. McCabe-Dansted, M. A. Reynolds
Publication date: 2 May 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.02.003
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A tableau-based decision procedure for CTL\(^*\)
- Results on the propositional \(\mu\)-calculus
- Using branching time temporal logic to synthesize synchronization skeletons
- A logic for reasoning about time and reliability
- Defeasible deontic logic
- Graded modalities in strategy logic
- Reasoning about graded strategy quantifiers
- CTL\(^\ast\) with graded path modalities
- To be fair, use bundles
- An axiomatization of full Computation Tree Logic
- A Rooted Tableau for BCTL*
- Satisfiability Games for Branching-Time Logics
- Graded computation tree logic
- A complete axiomatization of a temporal logic with obligation and robustness
- A Tableau for Bundled CTL
- Alternating-time temporal logic
- A Temporal Logic of Robustness
- A Tableau for RoBCTL
- Robust normative systems and a logic of norm compliance
- Logics for Qualitative Coalitional Games
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Deciding full branching time logic
- “Sometimes” and “not never” revisited
- The complexity of propositional linear temporal logics
- Deterministic reliability-modeling of dynamic redundancy
- Augmenting branching temporal logics with existential quantification over atomic propositions
- The Complexity of Tree Automata and Logics of Programs
- Expressiveness and succinctness of a logic of robustness
- The Tableau Workbench
- Temporal logics for the specification of performance and reliability
- A resolution calculus for the branching-time temporal logic CTL
- A Decision Procedure for CTL* Based on Tableaux and Automata
- Graded Alternating-Time Temporal Logic
- Ernst Mally's Deontik (1926)
This page was built for publication: Sublogics of a branching time logic of robustness
