Using bisimulation proof techniques for the analysis of distributed abstract machines

DOI10.1016/J.TCS.2008.04.035MaRDI QIDQ935472zbMATH OpenOpenAlexFDO

Authors 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 algebrasup-to techniquesforwardersweak bisimilaritydistributed abstract machines

Mathematics Subject Classification ID

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

Recommendations

• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• New up-to techniques for weak bisimulation
• scientific article; zbMATH DE number 2038740
• Automata, Languages and Programming
• Beyond Bisimulation: The “up-to” Techniques

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1954375 (Why is no real title available?)
• scientific article; zbMATH DE number 2038740 (Why is no real title available?)
• scientific article; zbMATH DE number 1927577 (Why is no real title available?)
• scientific article; zbMATH DE number 1754608 (Why is no real title available?)
• scientific article; zbMATH DE number 1759482 (Why is no real title available?)
• scientific article; zbMATH DE number 2090726 (Why is no real title available?)
• scientific article; zbMATH DE number 2242580 (Why is no real title available?)
• A Distributed Pi-Calculus
• A theory of bisimulation for a fragment of concurrent ML with local names
• Adding recursion to Dpi
• An efficiency preorder for processes
• Automata, Languages and Programming
• Confluence by decreasing diagrams
• Confluence for process verification
• Efficiency of a Good But Not Linear Set Union Algorithm
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Linear forwarders
• Mobile ambients
• Nomadic Pict: correct communication infrastructure for mobile computation
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• On the bisimulation proof method
• Programming Languages and Systems
• Robust, distributed references and acyclic garbage collection
• The Kell calculus: operational semantics and type system.
• The \(\pi\)-calculus: A theory of mobile processes

Cited in

(5)

• scientific article; zbMATH DE number 2084333 (Why is no real title available?)
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• Bisimulation and coinduction enhancements: a historical perspective
• Divergence and unique solution of equations
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)

Describes a project that uses

Uses Software

• JoCaml
• KLAIM

This page was built for publication: Using bisimulation proof techniques 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 Q935472)