Results 1  10
of
20
Comparing Logics for Rewriting: Rewriting logic, action calculi and tile logic
 Theoretical Computer Science
, 2002
"... The large diffusion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy specification of such systems. The aim of our paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, c ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
The large diffusion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy specification of such systems. The aim of our paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rulebased systems. For each of these logics we first try to understand their foundations, then we briefly sketch some applications. The overall goal of our work is to find out a common layout where these logics can be recast, thus allowing for a comparison and an evaluation of their specific features.
Deconstructing behavioural theories of mobility
, 2008
"... Abstract. We reexamine the standard structural operational semantics of the πcalculus with the view that both process structure and contextual observational power should play roles in describing the behavioural theory. To that end we provide a decomposition of the operational semantics of π which ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Abstract. We reexamine the standard structural operational semantics of the πcalculus with the view that both process structure and contextual observational power should play roles in describing the behavioural theory. To that end we provide a decomposition of the operational semantics of π which allows for a systematic definition of labelled transitions. These are derived from the calculus ’ underlying reduction rules by following the contextsaslabels philosophy while being presented using the structural approach. Our novel transition system refines to a composite description of the standard early lts. We generalise our technique to higherorder and asynchronous variants.
An Interactive Semantics of Logic Programming
 THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2001
"... We apply to logic programming some recently emerging ideas from the field of reductionbased communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational machinery of such a programming paradigm. The semantic framework we ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We apply to logic programming some recently emerging ideas from the field of reductionbased communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational machinery of such a programming paradigm. The semantic framework we have chosen for presenting our results is tile logic, which has the advantage of allowing a uniform treatment of goals and observations and of applying abstract categorical tools for proving the results. As main contributions, we mention the finitary presentation of abstract unification, and a concurrent and coordinated abstract semantics consistent with the most common semantics of logic programming. Moreover, the compositionality of the tile semantics is guaranteed by standard results, as it reduces to check that the tile systems associated to logic programs enjoy the tile decomposition property. An extension of the approach for handling constraint systems is also discussed.
Consistent Transformations for Software Architecture Styles of Distributed Systems
, 1999
"... One major problem for the specification and verification of software architectures and specially with distributed systems, is when system evolution includes dynamic changes and reconfigurations of components and connections. This paper presents a method for specifying reconfigurations or transformat ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
One major problem for the specification and verification of software architectures and specially with distributed systems, is when system evolution includes dynamic changes and reconfigurations of components and connections. This paper presents a method for specifying reconfigurations or transformations over the topology of the architecture style, being sure that if the transformation can be specified, then its application over the system will be consistent with respect to the expected architecture style configuration. Styles are described by contextfree hyperedge graph grammars. In this context, an instance of an architecture style is determined by a graph generated by the grammar. The formalization of the method...
Variable binding, symmetric monoidal closed theories, and bigraphs
 In Bravetti and Zavattaro [2
"... bigraphs ..."
Binding bigraphs as symmetric monoidal closed theories
, 810
"... Abstract. Milner’s bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the πcalculus [2] and the Ambient calculus [3]. This paper is only concerned with bigraphical syntax: given what we here call ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Milner’s bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the πcalculus [2] and the Ambient calculus [3]. This paper is only concerned with bigraphical syntax: given what we here call a bigraphical signature K, Milner constructs a (pre) category of bigraphs Bbg(K), whose main features are (1) the presence of relative pushouts (RPOs), which makes them wellbehaved w.r.t. bisimulations, and that (2) the socalled structural equations become equalities. Examples of the latter are, e.g., in π and Ambients, renaming of bound variables, associativity and commutativity of parallel composition, or scope extrusion for νbound names. Also, bigraphs follow a scoping discipline ensuring that, roughly, bound variables never escape their scope. Here, we reconstruct bigraphs using a standard categorical tool: symmetric monoidal closed (smc) theories. Our theory enforces the same scoping discipline as bigraphs, as a direct property of smc structure. Furthermore, it elucidates the slightly mysterious status of socalled edges in
Appligraph: Applications of Graph Transformation  Fourth Annual Progress Report
, 2001
"... This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and devel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and development of systems, languages, and tools and to improve the awareness of its industrial relevance
On Double Categories and Multiplicative Linear Logic
, 1999
"... this article, we attack the converse problem of explaining semantics as an artifact of syntax, in other words, of extracting the meaning of a program from syntactical considerations on its dynamics, or the way it interacts with the environment. We start the analysis with a very simple slogan, where ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this article, we attack the converse problem of explaining semantics as an artifact of syntax, in other words, of extracting the meaning of a program from syntactical considerations on its dynamics, or the way it interacts with the environment. We start the analysis with a very simple slogan, where we use module to mean procedure, in the fashion of (Girard 1987b):
First Order and Higher Order Tile Models for Open and Mobile Systems
 In Proceedings of TOSCA'00, Workshop Annuale del Progetto TOSCA, 2000. Virtual Proceedings
, 2000
"... h ground and open terms in a uniform way. To this aim, transition labels become pairs, whose components are called triggers (expressing the interaction of a context with its arguments) and effect (representing the behavior offered to the rest of the system, i.e. a possible context). Tiles can be rep ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
h ground and open terms in a uniform way. To this aim, transition labels become pairs, whose components are called triggers (expressing the interaction of a context with its arguments) and effect (representing the behavior offered to the rest of the system, i.e. a possible context). Tiles can be represented as rectangles where the horizontal dimension is devoted to the assembling of states and the vertical dimension is dedicated to the evolution of components. Thus, triggers and effects form the left and right sides of tiles, respectively. The vertices of tiles are called interfaces, connecting the input and output observations to the initial (before the step) and final (after the step) configurations. Thanks to the abstract notions of configuration and observation, tiles allow us to develop a theoretical framework parametric in such structures (e.g. graphs or hypergraphs or trees or lterms rather than terms), and able to capture analogies in the structures by means of suitable auxili