Deciding bisimulation and trace equivalences for systems with many identical processes

DOI10.1007/BFB0015435MaRDI QIDQ6487976zbMATH OpenFDO

Authors Hsu-Chun Yen, Shi-Tsuen Jian, Ta-Pang Lao

Publication date 21 March 2023

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Deciding bisimulation and trace equivalences for systems with many identical processes
• On deciding trace equivalences for processes
• Bisimulation equivalence is decidable for one-counter processes
• CCS expressions, finite state processes, and three problems of equivalence
• scientific article; zbMATH DE number 149518

Cites work

• CCS expressions, finite state processes, and three problems of equivalence
• scientific article; zbMATH DE number 446840 (Why is no real title available?)
• scientific article; zbMATH DE number 1414283 (Why is no real title available?)
• On the analysis of cooperation and antagonism in networks of communicating processes
• Priority systems with many identical processes
• Reasoning about systems with many processes

Cited in

(5)

• Verifying identical communicating processes is undecidable
• On deciding trace equivalences for processes
• Deciding Bisimilarity of Full BPA Processes Locally
• scientific article; zbMATH DE number 1954392 (Why is no real title available?)
• Deciding bisimulation and trace equivalences for systems with many identical processes

This page was built for publication: Deciding bisimulation and trace equivalences for systems with many identical processes

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