On Bisimulation Proofs for the Analysis of Distributed Abstract Machines

DOI10.1007/978-3-540-75336-0_10zbMath1211.68271OpenAlexW1492584023MaRDI QIDQ3608458

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

Mathematics Subject Classification ID

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

Related Items (2)

New up-to techniques for weak bisimulation ⋮ Using bisimulation proof techniques for the analysis of distributed abstract machines

Uses Software

• JoCaml

Cites Work

• Nomadic pict
• Automata, Languages and Programming
• Formal Methods for Open Object-Based Distributed Systems
• Unnamed Item

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