Realizability of concurrent recursive programs (Q1620953): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2963915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllers for the Verification of Communicating Multi-pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Communicating Multi-pushdown Systems via Split-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS / 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: Model-Checking Bounded Multi-Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Concurrent Recursive Programs / 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: Synthesis of Safe Message-Passing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of 2-Stack Visibly Pushdown Automata / 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: Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kleene theorem and model checking algorithms for existentially bounded communicating automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3504343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Exponential-Size Deterministic Zielonka Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis of Communicating Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of regular MSC languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular sets of infinite message sequence charts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted asynchronous cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded MSC communication / 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: Scope-Bounded Pushdown Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unifying Approach for Multistack Pushdown Automata / 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: Interprocedural Analysis of Concurrent Programs Under a Context Bound / 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: Q4941891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree width of auxiliary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Visibly Pushdown Trace Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages / 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: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Revision as of 09:09, 17 July 2024

scientific article
Language Label Description Also known as
English
Realizability of concurrent recursive programs
scientific article

    Statements

    Realizability of concurrent recursive programs (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2018
    0 references
    concurrent recursive programs
    0 references
    realizability
    0 references
    asynchronous automata
    0 references
    nested-word automata
    0 references
    Mazurkiewicz traces
    0 references
    Zielonka's theorem
    0 references
    monadic second-order logic
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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