Undecidability results for deterministic communicating sequential processes

DOI10.1109/9.58531zbMATH Open0715.68024OpenAlexW2139150329MaRDI QIDQ3201754FDOQ3201754

Authors Randall A. Cieslak, Pravin Varaiya

Publication date 1990

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.58531

zbMATH Keywords

communicating sequential processes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• An incompleteness result in process algebra
• A Theory of Communicating Sequential Processes
• Verifying identical communicating processes is undecidable
• On the decidability of correctness problems for a communicating automata net
• The complexity of reachability in distributed communicating processes

Cited in

(15)

• Logical models of discrete even systems: a comparative exposition
• scientific article; zbMATH DE number 7438568 (Why is no real title available?)
• Decidability problems for actor systems
• On the computational power of BlenX
• Communicating processes, scheduling, and the complexity of nontermination
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Boundedness analysis of finitely recursive processes. II. Sequential and hybrid processes
• Undecidability of accordance for open systems with unbounded message queues
• ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS
• Undecidability and hierarchy results for parallel communicating finite automata
• The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
• The complexity of reachability in distributed communicating processes
• An incompleteness result in process algebra
• Communication errors in the \(\pi\)-calculus are undecidable
• Decidability problems for actor systems

This page was built for publication: Undecidability results for deterministic communicating sequential processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201754)