Using bisimulation proof techniques for the analysis of distributed abstract machines

DOI10.1016/j.tcs.2008.04.035zbMath1146.68053MaRDI QIDQ935472

Damien Pous

Publication date: 6 August 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-ens-lyon.archives-ouvertes.fr/ensl-00149964/file/LIP-RR2007-31.pdf

zbMATH Keywords

process algebras; up-to techniques; forwarders; weak bisimilarity; distributed abstract machines

Mathematics Subject Classification ID

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

68M14: Distributed systems

Uses Software

• JoCaml
• KLAIM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Confluence for process verification
• Adding recursion to Dpi
• Confluence by decreasing diagrams
• An efficiency preorder for processes
• Mobile ambients
• A theory of bisimulation for a fragment of concurrent ML with local names
• Linear forwarders
• A Distributed Pi-Calculus
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• Efficiency of a Good But Not Linear Set Union Algorithm
• On the bisimulation proof method
• Nomadic pict
• Programming Languages and Systems
• Robust, distributed references and acyclic garbage collection
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Automata, Languages and Programming
• Formal Methods for Open Object-Based Distributed Systems