Undecidable equivalences for basic parallel processes

DOI10.1016/J.IC.2008.12.011MaRDI QIDQ2389334zbMATH OpenOpenAlexFDO

Authors Hans Hüttel, Naoki Kobayashi, Takashi Suto

Publication date 15 July 2009

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2008.12.011

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Publication:4490743
• Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
• Undecidable equivalences for basic process algebra
• On deciding trace equivalences for processes
• scientific article; zbMATH DE number 1555184

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1479629 (Why is no real title available?)
• scientific article; zbMATH DE number 1555184 (Why is no real title available?)
• scientific article; zbMATH DE number 1864591 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Bisimulation equivalence is decidable for all context-free processes
• CCS expressions, finite state processes, and three problems of equivalence
• On deciding readiness and failure equivalences for processes
• Process algebra for synchronous communication
• Type systems for concurrent programs.
• Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
• Undecidable equivalences for basic process algebra

Cited in

(8)

• Undecidability of accordance for open systems with unbounded message queues
• Space-efficient scheduling of stochastically generated tasks
• An incompleteness result in process algebra
• Undecidable equivalences for basic process algebra
• Non-interleaving bisimulation equivalences on basic parallel processes
• scientific article; zbMATH DE number 1479629 (Why is no real title available?)
• Decidability of performance equivalence for basic parallel processes
• Analysis of probabilistic basic parallel processes

This page was built for publication: Undecidable equivalences for basic parallel processes

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