Synchronous message passing: on the relation between bisimulation and refusal equivalence

DOI10.1007/978-3-642-11512-7_8MaRDI QIDQ5187823zbMATH OpenOpenAlexFDO

Authors Manfred Broy

Publication date 9 March 2010

Published in Concurrency, Compositionality, and Correctness (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11512-7_8

zbMATH Keywords

bisimulationrefusal equivalencesynchronous message passingtrace equivalence

Mathematics Subject Classification ID

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

Recommendations

• Communicating Sequential Processes. The First 25 Years
• Refusal testing
• On performance congruences for process algebras
• All congruences below stability-preserving fair testing or CFFD
• Proof systems for message-passing process algebras

Cites work

• A Theory of Communicating Sequential Processes
• Communicating sequential processes
• Concurrency verification. Introduction to compositional and noncompositional methods
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3688686 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 42237 (Why is no real title available?)
• Power simulation and its relation to traces and failures refinement

Cited in

(1)

• scientific article; zbMATH DE number 7774258 (Why is no real title available?)

This page was built for publication: Synchronous message passing: on the relation between bisimulation and refusal equivalence

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