The complexity of problems in systems of communicating sequential processes
type: Item
instance of: scholarly article
title: The complexity of problems in systems of communicating sequential processes
zbMATH Open document ID: 0448.68012
DOI: 10.1016/0022-0000(80)90033-1
author: Richard E. Ladner
published in: Journal of Computer and System Sciences
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3702100
zbMATH Keywords: sequential processes
zbMATH Keywords: communicating processes
zbMATH Keywords: lockout problem
MaRDI profile type: Publication
full work available at URL: 0022-0000(80)90033-1
OpenAlex ID: W1986355834
cites work: Provably Difficult Combinatorial Games
cites work: Game interpretation of the deadlock avoidance problem
cites work: A Combinatorial Problem Which Is Complete in Polynomial Space
cites work: Communicating sequential processes
cites work: A new solution of Dijkstra's concurrent programming problem
cites work: Q4190122
cites work: Concurrent Processes and Their Syntax
cites work: On the complexity of some two-person perfect-information games
description: scientific article; zbMATH DE number 3702100