Approximating weak bisimilarity of basic parallel processes

MaRDI QIDQ4986262zbMATH OpenFDO

Authors Piotr Hofman, Patrick Totzke

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2751, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS12.8

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1418352
• Weak Bisimulation Approximants
• scientific article; zbMATH DE number 1701362
• Refining the undecidability border of weak bisimilarity
• scientific article; zbMATH DE number 1670835

Cited in

(8)

• Non-interleaving bisimulation equivalences on basic parallel processes
• Decidability of branching bisimulation on normed commutative context-free processes
• Modifications of expansion trees for weak bisimulation in BPA
• More on Weak Bisimilarity of Normed Basic Parallel Processes
• Weak Bisimulation Approximants
• scientific article; zbMATH DE number 1232246 (Why is no real title available?)
• scientific article; zbMATH DE number 2086414 (Why is no real title available?)
• scientific article; zbMATH DE number 1418352 (Why is no real title available?)

This page was built for publication: Approximating weak bisimilarity of basic parallel processes

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