On the analysis of cooperation and antagonism in networks of communicating processes

DOI10.1007/BF01762125zbMath0636.68023OpenAlexW2021055532MaRDI QIDQ1098279

Paris C. Kanellakis, Scott A. Smolka

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762125

zbMATH Keywords

terminationconcurrent programmingPSPACE-completecommunicating finite state processesloockoutPotential blocking

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

CCS expressions, finite state processes, and three problems of equivalence, Deciding bisimulation and trace equivalences for systems with many identical processes, Complexity analysis of propositional concurrent programs using domino tiling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exposure to deadlock for communicating processes is hard to detect
• The complexity of problems in systems of communicating sequential processes
• A calculus of communicating systems
• Complexity of analyzing the synchronization structure of concurrent programs
• On Communicating Finite-State Machines
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• A Theory of Communicating Sequential Processes
• Proving Liveness Properties of Concurrent Programs