On Bisimulation Proofs for the Analysis of Distributed Abstract Machines

DOI10.1007/978-3-540-75336-0_10zbMATH Open1211.68271OpenAlexW1492584023MaRDI QIDQ3608458FDOQ3608458

Authors: Damien Pous 

Publication date: 5 March 2009

Published in: Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75336-0_10

Recommendations

• Using bisimulation proof techniques for the analysis of distributed abstract machines
• scientific article; zbMATH DE number 3898224
• scientific article; zbMATH DE number 2038740
• Sound bisimulations for higher-order distributed process calculus
• On the bisimulation proof method

Mathematics Subject Classification ID

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

Cites Work

• The Kell calculus: operational semantics and type system.
• Nomadic Pict: correct communication infrastructure for mobile computation
• Automata, Languages and Programming
• Title not available (Why is that?)

Cited In (4)

• New up-to techniques for weak bisimulation
• Distributed branching bisimulation reduction of state spaces
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
• Using bisimulation proof techniques for the analysis of distributed abstract machines

Uses Software

• JoCaml

This page was built for publication: On Bisimulation Proofs for the Analysis of Distributed Abstract Machines

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