Deciding bisimulation and trace equivalences for systems with many identical processes

DOI10.1007/BFB0015435zbMATH Open1512.68177MaRDI QIDQ6487976FDOQ6487976

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

Publication date: 21 March 2023

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

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)

Cites Work

• Reasoning about systems with many processes
• CCS expressions, finite state processes, and three problems of equivalence
• Title not available (Why is that?)
• On the analysis of cooperation and antagonism in networks of communicating processes
• Title not available (Why is that?)
• Priority systems with many identical processes

Cited In (4)

• On deciding trace equivalences for processes
• Deciding Bisimilarity of Full BPA Processes Locally
• Title not available (Why is that?)
• 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)