Results 1 
5 of
5
Process and Term Tile Logic
, 1998
"... In a similar way as 2categories can be regarded as a special case of double categories, rewriting logic (in the unconditional case) can be embedded into the more general tile logic, where also sideeffects and rewriting synchronization are considered. Since rewriting logic is the semantic basis o ..."
Abstract

Cited by 33 (25 self)
 Add to MetaCart
In a similar way as 2categories can be regarded as a special case of double categories, rewriting logic (in the unconditional case) can be embedded into the more general tile logic, where also sideeffects and rewriting synchronization are considered. Since rewriting logic is the semantic basis of several language implementation efforts, it is useful to map tile logic back into rewriting logic in a conservative way, to obtain executable specifications of tile systems. We extend the results of earlier work by two of the authors, focusing on some interesting cases where the mathematical structures representing configurations (i.e., states) and effects (i.e., observable actions) are very similar, in the sense that they have in common some auxiliary structure (e.g., for tupling, projecting, etc.). In particular, we give in full detail the descriptions of two such cases where (net) processlike and usual term structures are employed. Corresponding to these two cases, we introduce two ca...
Executable Tile Specifications for Process Calculi
, 1999
"... . Tile logic extends rewriting logic by taking into account sideeffects and rewriting synchronization. These aspects are very important when we model process calculi, because they allow us to express the dynamic interaction between processes and "the rest of the world". Since rewriting logic is the ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
. Tile logic extends rewriting logic by taking into account sideeffects and rewriting synchronization. These aspects are very important when we model process calculi, because they allow us to express the dynamic interaction between processes and "the rest of the world". Since rewriting logic is the semantic basis of several language implementation efforts, an executable specification of tile systems can be obtained by mapping tile logic back into rewriting logic, in a conservative way. However, a correct rewriting implementation of tile logic requires the development of a metalayer to control rewritings, i.e., to discard computations that do not correspond to any deduction in tile logic. We show how such methodology can be applied to term tile systems that cover and extend a wideclass of SOS formats for the specification of process calculi. The wellknown casestudy of full CCS, where the term tile format is needed to deal with recursion (in the form of the replicator operator), is di...
Enriched Categories as Models of Computation
 in Proc. Fifth Italian Conference on Theoretical Computer Science, ICTCS'95 , World Scientific
, 1996
"... . In this paper we discuss a general methodology to provide a categorical semantics for a wide class of computational systems, whose behaviour can be described by a suitable set of transition steps. We open our survey presenting some results on the semantics of Petri Nets. Starting from this, we ela ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
. In this paper we discuss a general methodology to provide a categorical semantics for a wide class of computational systems, whose behaviour can be described by a suitable set of transition steps. We open our survey presenting some results on the semantics of Petri Nets. Starting from this, we elaborate a twosteps procedure allowing for the description of all the sequences of transitions performed by a given system, and equipping them with a suitable equivalence relation. This relation provides the sistem under analisys with a concurrent semantics: equivalence classes denote families of "computationally equivalent" behaviours, corresponding to the execution of the same set of (causally) independent transition steps. 1 Introduction The latest years have seen a wide amount of different approaches to the semantics of computional sistems: a variety that, if only for the comparison between the various formalisms, calls for a unified framework. In this paper we aim to show that enriched ...
Implementing Tile Systems: Some Examples From Process Calculi
, 1998
"... this paper we show some example of their application to implement concurrent process calculi. In particular, in Section 2 we define executable implementations of CCSlike languages, preserving their original operational semantics. The two case studies considered here are the tile specification of fi ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
this paper we show some example of their application to implement concurrent process calculi. In particular, in Section 2 we define executable implementations of CCSlike languages, preserving their original operational semantics. The two case studies considered here are the tile specification of finite CCS given in