Undecidable equivalences for basic parallel processes

DOI10.1016/j.ic.2008.12.011zbMath1167.68041OpenAlexW2160628618MaRDI QIDQ2389334

Takashi Suto, Hans Hüttel, Naoki Kobayashi

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)

Related Items

Space-efficient scheduling of stochastically generated tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CCS expressions, finite state processes, and three problems of equivalence
• Undecidable equivalences for basic process algebra
• On deciding readiness and failure equivalences for processes
• Bisimulation equivalence is decidable for all context-free processes
• Process algebra for synchronous communication
• Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
• Formal Methods at the Crossroads. From Panacea to Foundational Support