The complexity of problems in systems of communicating sequential processes

DOI10.1016/0022-0000(80)90033-1zbMath0448.68012OpenAlexW1986355834MaRDI QIDQ1146980

Richard E. Ladner

Publication date: 1980

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(80)90033-1

zbMATH Keywords

sequential processescommunicating processeslockout problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Theory of operating systems (68N25)

Related Items

On the analysis of cooperation and antagonism in networks of communicating processes, The complexity of reachability in distributed communicating processes, On the complexity of deciding fair termination of probabilistic concurrent finite-state programs, A multiparameter analysis of domino tiling with an application to concurrent systems, Communicating processes, scheduling, and the complexity of nontermination, Port automata and the algebra of concurrent porcesses, Global and local views of state fairness, Complexity analysis of propositional concurrent programs using domino tiling

Cites Work

• Unnamed Item
• On the complexity of some two-person perfect-information games
• Provably Difficult Combinatorial Games
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Communicating sequential processes
• Concurrent Processes and Their Syntax
• Game interpretation of the deadlock avoidance problem
• A new solution of Dijkstra's concurrent programming problem