The complexity of problems in systems of communicating sequential processes (Q1146980): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Provably Difficult Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game interpretation of the deadlock avoidance problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution of Dijkstra's concurrent programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Processes and Their Syntax / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank

Latest revision as of 09:57, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of problems in systems of communicating sequential processes
scientific article

    Statements

    The complexity of problems in systems of communicating sequential processes (English)
    0 references
    0 references
    1980
    0 references
    sequential processes
    0 references
    communicating processes
    0 references
    lockout problem
    0 references

    Identifiers