Realizability of Concurrent Recursive Programs (Q3617744): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: First-Order and Temporal Logics for Nested Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Nesting Structure to Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding Synthesis of Asynchronous Automata / 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: A Generic Approach to the Static Analysis of Concurrent Programs with Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL is expressively complete for Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / 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: Constructing Exponential-Size Deterministic Zielonka Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of regular MSC languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted asynchronous cellular automata / 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: Q4251925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941891 / 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: Model Checking Multithreaded Programs with Asynchronous Atomic Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 05:45, 29 June 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
    31 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references