Tiles, rewriting rules and CCS.

*(English)*Zbl 0917.68115
Meseguer, J. (ed.), Rewriting logic and its applications. Proceedings of the 1st international workshop, Pacific Grove, CA, USA, September 3–6, 1996. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 4, 19 p. (1996).

Summary: In 1996 [Technical Report TR-96-27, Dept. Computer Science, Univ. of Pisa] we introduced the tile model, a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting and of concurrency theory, and our formalism recollects many properties of these sources. For example, it provides a compositional way to describe both the states and the sequences of transitions performed by a given system, stressing their distributed nature. Moreover, a suitable notion of typed proof allows to take into account also those formalisms relying on the notions of synchronization and side-effects to determine the actual behaviour of a system. In this work we narrow our scope, presenting a restricted version of our tile model and focussing our attention on its expressive power. To this aim, we recall the basic definitions of the process algebras paradigm, centering the paper on the recasting of this framework in our formalism.

For the entire collection see [Zbl 0903.00068].

For the entire collection see [Zbl 0903.00068].

##### MSC:

68Q42 | Grammars and rewriting systems |