The complexity of model checking multi-stack systems (Q2398213): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Verifying Communicating Multi-pushdown Systems via Split-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order and Temporal Logics for Nested Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Checking of Ordered Multi-Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logics for concurrent recursive programs: satisfiability and model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal construction of Hanf sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Model Checking Multi-stack Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5227061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSO Decidability of Multi-Pushdown Systems via Split-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monadic NP vs monadic co-NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis of Communicating Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Bounded Analysis of Concurrent Queue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Automaton Characterization of Double Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Temporal Logic for Multi-threaded Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree width of auxiliary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Concurrent Recursive Programs Using Temporal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Translating Logic to Finite Automata / rank
 
Normal rank

Latest revision as of 07:01, 14 July 2024

scientific article
Language Label Description Also known as
English
The complexity of model checking multi-stack systems
scientific article

    Statements

    The complexity of model checking multi-stack systems (English)
    0 references
    0 references
    0 references
    0 references
    15 August 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-stack systems
    0 references
    temporal logics
    0 references
    model checking
    0 references
    multiply nested words
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references