×

zbMATH — the first resource for mathematics

Proof methodologies for behavioural equivalence in DPI. (English) Zbl 1169.68538
Wang, Farn (ed.), Formal techniques for networked and distributed systems – FORTE 2005. 25th IFIP WG 6.1 international conference, Taipei, Taiwan, October 2–5, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29189-X/pbk). Lecture Notes in Computer Science 3731, 335-350 (2005).
Summary: We focus on techniques for proving behavioural equivalence between systems in DPI, a distributed version of the pi-calculus in which processes may migrate between dynamically created locations, and where resource access policies are implemented by means of capability types.
We devise a tractable collection of auxiliary proof methods, relying mainly on the use of bisimulations up-to \(\beta\)-reductions, which considerably relieve the burden of exhibiting witness bisimulations. Using such methods we model simple distributed protocols, such as crossing a firewall, a server and its clients, metaservers installing memory services, and address their correctness in a relatively simple manner.
For the entire collection see [Zbl 1089.68015].

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDF BibTeX XML Cite
Full Text: DOI