Results 1  10
of
10
Bisimilarity of Open Terms
, 2000
"... Traditionally, in process calculi, relations over open terms, i.e., terms with free process variables, are defined as extensions of closedterm relations: two open terms are related if and only if all their closed instantiations are related. Working in the context of bisimulation, in this paper we s ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Traditionally, in process calculi, relations over open terms, i.e., terms with free process variables, are defined as extensions of closedterm relations: two open terms are related if and only if all their closed instantiations are related. Working in the context of bisimulation, in this paper we study a different approach; we define semantic models for open terms, socalled conditional transition systems, and define bisimulation directly on those models. It turns out that this can be done in at least two different ways, one giving rise to De Simone's formal hypothesis bisimilarity and the other to a variation which we call hypothesispreserving bisimilarity (denoted t fh and t hp, respectively). For open terms, we have (strict) inclusions t fh /t hp / t ci (the latter denoting the standard ``closed instance' ' extension); for closed terms, the three coincide. Each of these relations is a congruence in the usual sense. We also give an alternative characterisation of t hp in terms of nonconditional transitions, as substitutionclosed bisimilarity (denoted t sb). Finally, we study the issue of recursion congruence: we prove that each of the above relations is a congruence with respect to the recursion operator; however, for t ci this result holds under more restrictive conditions than for tfh and thp.]
Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems
 Applied Categorical Structures
, 1999
"... . In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. The basic idea is ..."
Abstract

Cited by 17 (14 self)
 Add to MetaCart
. In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. The basic idea is to use graphs to represent states of such systems, and graph rewriting to represent their evolution. The kind of graph rewriting we use is based on simple contextfree productions which are however combined by means of a synchronization mechanism. This allows for a good level of expressivity in the system without sacrifying full distribution. To formally model this kind of graph rewriting, however, we do not adopt the classical graph rewriting style but a more general framework, called the tile model, which allows for a clear separation between sequential rewriting and synchronization. Then, since the problem of satisfying the synchronization requirements may be a complex combinatorial pro...
Tile Bisimilarity Congruences for Open Terms and Term Graphs
 in: Proc. CONCUR 2000, LNCS 1877 (2000
, 2000
"... The definition of sos formats ensuring that bisimilarity on closed terms is a congruence has received much attention in the last two decades. For dealing with open system specifications, the congruence is usually lifted from closed terms to open terms by instantiating the free variables in all possi ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
The definition of sos formats ensuring that bisimilarity on closed terms is a congruence has received much attention in the last two decades. For dealing with open system specifications, the congruence is usually lifted from closed terms to open terms by instantiating the free variables in all possible ways; the only alternatives considered in the literature relying on Larsen and Xinxin's context systems and Rensink's conditional transition systems. We propose a different approach based on tile logic, where both closed and open terms are managed analogously. In particular, we analyze the `bisimilarity as congruence' property for several tile formats that accomplish di erent concepts of subterm sharing.
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.
CCS Semantics via Proved Transition Systems and Rewriting Logic
 In Kirchner and Kirchner [47
, 1998
"... We consider (a slight variant of) the ccs calculus, and we analyze two operational semantics defined in the literature: the first exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We show that the interleaving interpretation of both semantics agree, in that they define th ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We consider (a slight variant of) the ccs calculus, and we analyze two operational semantics defined in the literature: the first exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We show that the interleaving interpretation of both semantics agree, in that they define the same transitions and exhibit the same nondeterministic structure. In addition, we study causality in ccs computations. We recall the treatment via pts, that exhibits the notion of causality presented in the literature, and we show how to recast it in the rl semantics via suitable axioms. 1 Introduction Concurrency is maybe the basic aspect of the operational interpretation of rewriting logic. And as Jos'e Meseguer says in his lecture at concur'96 [20], . . . my main emphasis in this talk will be on rewriting logic as a semantic framework for concurrency. . . . The goal is . . . to express as faithfully as possible each model [of concurrency] on its own terms, avoiding any encodings or tr...
A Causal Semantics for CCS via Rewriting Logic
 Theoretical Computer Science
, 2000
"... We consider two operational semantics for ccs dened in the literature: the rst exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We show that the interleaving interpretation of both semantics agree, in that they dene the same transitions and exhibit the same nondeterminis ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We consider two operational semantics for ccs dened in the literature: the rst exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We show that the interleaving interpretation of both semantics agree, in that they dene the same transitions and exhibit the same nondeterministic structure. In addition, we study causality in ccs computations. We recall its treatment via pts, exhibiting the notion of causality presented in the literature, and we show how to recast it in the rl semantics via suitable axioms. Also in this case, the two semantics agree. Contents 1 Introduction 2 2 Some notions on Process Algebras 3 2.1 The Calculus of Communicating Systems 4 2.2 Proved Transition System 6 2.3 Causality and Concurrency 7 ? Research partly supported by the Italian CNR Progetto Strategico Modelli e Metodi per la Matematica e l'Ingegneria and MURST Progetto Tecniche Formali per la Specica, l'Analisi, la Verica, la Sintesi e la Trasformazione di Sistemi Software. ...
Logical Specification of Operational Semantics
 IN CSL'99, PROC. CONF. ON COMPUTER SCIENCE LOGIC, VOLUME 1683 OF LNCS
, 1999
"... Various logicbased frameworks have been proposed for specifying the operational semantics of programming languages and concurrent systems, including inference systems in the styles advocated by Plotkin and by Kahn, Horn logic, equational specifications, reduction systems for evaluation contexts ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Various logicbased frameworks have been proposed for specifying the operational semantics of programming languages and concurrent systems, including inference systems in the styles advocated by Plotkin and by Kahn, Horn logic, equational specifications, reduction systems for evaluation contexts, rewriting logic, and tile logic. We consider
Can Actors and πAgents Live Together?
"... The syntax and semantics of actors and agents is first defined separately, using a uniform, "unbiased" approach. New coordination primitives are the added to the union of the two calculi which allow actors and agents to cooperate. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The syntax and semantics of actors and agents is first defined separately, using a uniform, "unbiased" approach. New coordination primitives are the added to the union of the two calculi which allow actors and agents to cooperate.
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):