Model checking memoryful linear-time logics over one-counter automata (Q974117): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle Expressions and Words with Nested Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data trees and XML reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Depth Data Trees / 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: On the freeze quantifier in Constraint LTL: Decidability and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safely Freezing LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability and complexity of Metric Temporal Logic over finite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to data languages and timed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state machines for strings over infinite alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and Logics for Words and Trees over an Infinite Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Notions of Regularity for Data Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of modal and temporal logics with reference pointers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Variable Fragments of Hybrid Logics / 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: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP lower bounds for equivalence-checking and model-checking of one-counter automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Freeze LTL over One-Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Model-Checking Freeze LTL over Counter Machines Becomes Decidable / rank
 
Normal rank

Revision as of 20:36, 2 July 2024

scientific article
Language Label Description Also known as
English
Model checking memoryful linear-time logics over one-counter automata
scientific article

    Statements

    Model checking memoryful linear-time logics over one-counter automata (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2010
    0 references
    one-counter automaton
    0 references
    temporal logic
    0 references
    first-order logic
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers