The model checking fingerprints of CTL operators (Q2317834): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tractability of model checking for LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Generalized Satisfiability for Linear Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking CTL is Almost Always Inherently Sequential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of short two-person games / 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: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / 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: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: The model checking fingerprints of CTL operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the expressive power of CTL combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4584892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL<sup>⋆</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-optimal method for reasoning about action / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3246315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311048 / rank
 
Normal rank

Latest revision as of 03:19, 20 July 2024

scientific article
Language Label Description Also known as
English
The model checking fingerprints of CTL operators
scientific article

    Statements

    The model checking fingerprints of CTL operators (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers