Expressiveness and succinctness of a logic of robustness (Q4586143): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/11663081.2015.1050907 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2252821131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Propositional Deontic Temporal Logic via a μ-Calculus Characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust normative systems and a logic of norm compliance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games for synthesis of controllers with partial observation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enriched Mu-Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Analysis of Timed Automata Via Channel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deontic Logic in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resource logic for multi-agent plan merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative semantics for temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Tree Automata and Logics of Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AI 2003: Advances in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Temporal Logic of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete axiomatization of a temporal logic with obligation and robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for CTL* Based on Tableaux and Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hybrid Extension of CTL and CTL + / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in computer science. A study on extensions of temporal and strategic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tableau for RoBCTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rooted Tableau for BCTL* / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tableau-based decision procedure for CTL\(^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Variable Fragments of Hybrid Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4648830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus / rank
 
Normal rank

Latest revision as of 13:59, 16 July 2024

scientific article; zbMATH DE number 6935517
Language Label Description Also known as
English
Expressiveness and succinctness of a logic of robustness
scientific article; zbMATH DE number 6935517

    Statements

    Expressiveness and succinctness of a logic of robustness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2018
    0 references
    robustness
    0 references
    succinctness
    0 references
    branching time
    0 references
    RoCTL\(^\ast\)
    0 references
    QCTL\(^\ast\)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers