Sublogics of a branching time logic of robustness (Q1740655): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2019.02.003 / rank
Normal rank
 
Property / author
 
Property / author: John C. McCabe-Dansted / rank
Normal rank
 
Property / author
 
Property / author: M. A. Reynolds / rank
Normal rank
 
Property / author
 
Property / author: John C. McCabe-Dansted / rank
 
Normal rank
Property / author
 
Property / author: M. A. Reynolds / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TWB / rank
 
Normal rank
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.1016/j.ic.2019.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2919677696 / 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: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness and succinctness of a logic of robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting branching temporal logics with existential quantification over atomic propositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tableau for Bundled CTL / 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: A Decision Procedure for CTL* Based on Tableaux and Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rooted Tableau for BCTL* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Games for Branching-Time Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: To be fair, use bundles / 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: A resolution calculus for the branching-time temporal logic CTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tableau Workbench / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tableau for RoBCTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defeasible deontic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Temporal Logic of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatization of full Computation Tree Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / 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: The complexity of propositional linear temporal logics / 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: Temporal logics for the specification of performance and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic reliability-modeling of dynamic redundancy / 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: Ernst Mally's Deontik (1926) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics for Qualitative Coalitional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4648830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graded computation tree logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTL\(^\ast\) with graded path modalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graded Alternating-Time Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about graded strategy quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graded modalities in strategy logic / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2019.02.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:23, 11 December 2024

scientific article
Language Label Description Also known as
English
Sublogics of a branching time logic of robustness
scientific article

    Statements

    Sublogics of a branching time logic of robustness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 May 2019
    0 references
    RoCTL*
    0 references
    bundles
    0 references
    tableau
    0 references
    CTL
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers