Undecidable equivalences for basic parallel processes
From MaRDI portal
Publication:2389334
DOI10.1016/J.IC.2008.12.011zbMATH Open1167.68041OpenAlexW2160628618MaRDI QIDQ2389334FDOQ2389334
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- CCS expressions, finite state processes, and three problems of equivalence
- Type systems for concurrent programs.
- Undecidable equivalences for basic process algebra
- Bisimulation equivalence is decidable for all context-free processes
- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
- On deciding readiness and failure equivalences for processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- Non-interleaving bisimulation equivalences on basic parallel processes
- 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)
