zbMATH — the first resource for mathematics

A tile-based coordination view of asynchronous \(\pi\)-calculus. (English) Zbl 0941.68089
Privara, L. (ed.) et al., Mathematical foundations of computer science 1997. 22nd international symposium, MFCS ’97, Bratislava, Slovakia, August 25-29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1295, 52-70 (1997).
Summary: Tiles are rewrite rules with side effects, reminiscent of both Plotkin SOS and Meseguer rewriting logic rules. They are well suited for modeling coordination languages, since they can be composed both statically and dynamically via possibly complex synchronization and work-flow mechanisms. In this paper, we give a tile-based bisimilarity semantics for the asynchronous \(\pi\)-calculus of Honda and Tokoro and prove it equivalent to the ordinary semantics. Two kinds of tiles are provided: activity tiles and coordination tiles. Activity tiles specify the basic interactions sequential processes are able to perform, without considering the operational environment where they live. Instead, coordination tiles control the global evolution of programs.
For the entire collection see [Zbl 0920.00047].

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