Branching-time logics repeatedly referring to states (Q1047801): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4945233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid logics: characterization, interpolation and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of CTL* + Linear Past / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domino-tiling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking hybrid logics (with an application to semistructured data) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 years of model checking. History, achievements, perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of temporal logics with past / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification in CTL + past for verification in CTL. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of hybrid logics over transitive frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Variable Fragments of Hybrid Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank

Latest revision as of 07:49, 2 July 2024

scientific article
Language Label Description Also known as
English
Branching-time logics repeatedly referring to states
scientific article

    Statements

    Branching-time logics repeatedly referring to states (English)
    0 references
    0 references
    6 January 2010
    0 references
    branching time logic
    0 references
    hybrid logic
    0 references
    temporal logic
    0 references
    complexity
    0 references
    CTL
    0 references
    pebble automata
    0 references
    alternating tree automata
    0 references
    symmetric automata
    0 references
    satisfiability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references