Results 1  10
of
15
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
, 2004
"... Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (doublepushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, ..."
Abstract

Cited by 75 (15 self)
 Add to MetaCart
Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (doublepushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, of the category under consideration. This allows us to present a very simple way of deriving labelled transitions (called rewriting steps with borrowed context) which smoothly integrates with the DPO approach, has a very constructive nature and requires only a minimum of category theory. The core part of this paper is the proof sketch that the bisimilarity based on rewriting with borrowed contexts is a congruence relation.
Cartesian Closed Double Categories, their LambdaNotation, and the PiCalculus
, 1999
"... We introduce the notion of cartesian closed double category to provide mobile calculi for communicating systems with specific semantic models: One dimension is dedicated to compose systems and the other to compose their computations and their observations. Also, inspired by the connection between s ..."
Abstract

Cited by 22 (12 self)
 Add to MetaCart
We introduce the notion of cartesian closed double category to provide mobile calculi for communicating systems with specific semantic models: One dimension is dedicated to compose systems and the other to compose their computations and their observations. Also, inspired by the connection between simply typed calculus and cartesian closed categories, we define a new typed framework, called double notation, which is able to express the abstraction /application and pairing/projection operations in all dimensions. In this development, we take the categorical presentation as a guidance in the interpretation of the formalism. A case study of the ßcalculus, where the double  notation straightforwardly handles name passing and creation, concludes the presentation.
A General Framework for Types in Graph Rewriting
, 2000
"... . A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type graph is invariant under reduction, but still contains meaningful behaviour information. We present conditions, a t ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
. A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type graph is invariant under reduction, but still contains meaningful behaviour information. We present conditions, a type system for graph rewriting should satisfy, and a methodology for proving these conditions. In two case studies it is shown how to incorporate existing type systems (for the polyadic  calculus and for a concurrent objectoriented calculus) into the general framework. 1 Introduction In the past, many formalisms for the specication of concurrent and distributed systems have emerged. Some of them are aimed at providing an encompassing theory: a very general framework in which to describe and reason about interconnected processes. Examples are action calculi [18], rewriting logic [16] and graph rewriting [3] (for a comparison see [4]). They all contain a method of building terms (or ...
GraphBased Design and Analysis of Dynamic Software Architectures
 In Concurrency, Graphs and Models, volume 5065 of LNCS
, 2008
"... Dedicated to Ugo Montanari in occasion of his 65th birthday Abstract. We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented in Alloy; ii) a process algebraic presentation of ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
Dedicated to Ugo Montanari in occasion of his 65th birthday Abstract. We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented in Alloy; ii) a process algebraic presentation of graph transformation implemented in Maude. The two approaches are compared by showing how different aspects can be tackled, including representation issues, modelling phases, property specification and analysis. 1
A Rewriting Logic Approach to Operational Semantics – Extended Abstract Abstract
, 2007
"... This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: bigstep and smallstep structural operational semantics (SOS), modular SOS, reductio ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: bigstep and smallstep structural operational semantics (SOS), modular SOS, reduction semantics with evaluation contexts, and continuationbased semantics. Each of these language definitional styles can be faithfully captured as an RLS theory, in the sense that there is a onetoone correspondence between computational steps in the original language definition and computational steps in the corresponding RLS theory. A major goal of this paper is to show that RLS does not force or preimpose any given language definitional style, and that its flexibility and ease of use makes RLS an appealing framework for exploring new definitional styles. 1
Connector Algebras, Petri Nets, and BIP ⋆
"... Abstract. In the area of componentbased software architectures, the term connector has been coined to denote an entity (e.g. the communication network, middleware or infrastructure) that regulate the interaction of independent components. Hence, a rigorous mathematical foundation for connectors is ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In the area of componentbased software architectures, the term connector has been coined to denote an entity (e.g. the communication network, middleware or infrastructure) that regulate the interaction of independent components. Hence, a rigorous mathematical foundation for connectors is crucial for the study of coordinated systems. In recent years, many different mathematical frameworks have been proposed to specify, design, analyse, compare, prototype and implement connectors rigorously. In this paper, we overview the main features of three notable frameworks and discuss their similarities, differences, mutual embedding and possible enhancements. First, we show that Sobocinski’s nets with boundaries are as expressive as Sifakis et al.’s BI(P), the BIP component framework without priorities. Second, we provide a basic algebra of connectors for BI(P) by exploiting Montanari et al.’s tile model and a recent correspondence result with nets with boundaries. Finally, we exploit the tile model as a unifying framework to compare BI(P) with other models of connectors and to propose suitable enhancements of BI(P). 1
A basic algebra of stateless connectors �
"... www.elsevier.com/locate/tcs The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the interaction among distributed components. Different kinds of connectors exist in t ..."
Abstract
 Add to MetaCart
(Show Context)
www.elsevier.com/locate/tcs The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the interaction among distributed components. Different kinds of connectors exist in the literature at different levels of abstraction. We focus on an algebra of connectors that exploits five kinds of basic connectors (plus their duals), namely symmetry, synchronization, mutual exclusion, hiding and inaction. Basic connectors can be composed in series and in parallel. We first define the operational, observational and denotational semantics of connectors, then we show that the observational and denotational semantics coincide and finally we give a complete normalform axiomatization. The expressiveness of the framework is witnessed by the ability to model all the (stateless) connectors of the architectural design language CommUnity and of the coordination language Reo.
found at the ENTCS Macro Home Page. A Rewriting Logic Approach to Operational Semantics – Extended Abstract
"... this file with prentcsmacro.sty for your meeting, ..."
(Show Context)
Four Equivalent Equivalences of Reductions
, 2002
"... Two coinitial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a di#erent order. We present four characterisations of such a notion of equivalence, based on permutation, standardisation, labelling and projection, respectively. We prove ..."
Abstract
 Add to MetaCart
Two coinitial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a di#erent order. We present four characterisations of such a notion of equivalence, based on permutation, standardisation, labelling and projection, respectively. We prove that the characterisations all yield the same notion of equivalence, for the class of firstorder leftlinear term rewriting systems. A crucial role in our development is played by the notion of a proof term. 1