Results 1 
5 of
5
Bialgebraic Methods and Modal Logic in Structural Operational Semantics
 Electronic Notes in Theoretical Computer Science
, 2007
"... Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational semantics (SOS). An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational semantics (SOS). An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this paper, bialgebraic semantics is combined with a coalgebraic approach to modal logic in a novel, general approach to proving the compositionality of process equivalences for languages defined by structural operational semantics. To prove compositionality, one provides a notion of behaviour for logical formulas, and defines an SOSlike specification of modal operators which reflects the original SOS specification of the language. This approach can be used to define SOS congruence formats as well as to prove compositionality for specific languages and equivalences. Key words: structural operational semantics, coalgebra, bialgebra, modal logic, congruence format 1
A Category of Explicit Fusions
, 2008
"... Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully employed for languages with asymmetric communication, like the πcalculus, are presheaf categories based on (injective) relabelings, such as Set. Calculi with symmetric binding, in the spirit of the fusion calculus, give rise to new research problems. In this work we examine the calculus of explicit fusions, and propose to model its syntax and semantics using the presheaf category Set E,whereE is the category of equivalence relations and equivalence preserving morphisms.
Synchronizations with Mobility for Graph Transformations ⋆
"... Our work is aimed at developing highlevel models for complex global computing systems. At the high level of abstraction, the primitives made available by the underlying middleware are used to coordinate the behaviours of different computational entities. Important features of such a kind of model a ..."
Abstract
 Add to MetaCart
Our work is aimed at developing highlevel models for complex global computing systems. At the high level of abstraction, the primitives made available by the underlying middleware are used to coordinate the behaviours of different computational entities. Important features of such a kind of model are: (i) expressiveness, since complex forms of interaction have to be modelled; (ii) compositionality, which is required to allow a bottomup development of systems. We propose an approach based on graph transformations, which extends Synchronized Hyperedge Replacement (SHR) [2]. The main advantage of SHR is that it can be easily implemented in a distributed setting. In fact, transformations are specified by defining the behaviour of single hyperedges via productions with local effects. Productions interact via synchronizations on common nodes and exchange data via name mobility in the Fusion Calculus style. We extend standard SHR by parameterizing the inference rules that are used to compose productions using a generalization of synchronization algebras that allows to specify the underlying synchronization model [4]. Thus by changing the synchronization algebra one can model systems based on different middlewares. The proposed extension adds structures suitable to deal with mobility and local resources, which are two main features of global computing systems. We formalize the model using a Labelled Transition System (LTS) where labels contain synchronizations and names of nodes. We prove that the resulting bisimilarity is a congruence w.r.t. the operators of a suitable algebra of graphs by showing that the LTS can be specified in De Simone format [1]. As an example, we study the equivalence of different implementations of dynamic routers. As a larger example, we show how to map Fusion Calculus into our model [3] and that this mapping provides a concurrent compositional semantics for it. References 1. M. Buscemi and U. Montanari. A first order coalgebraic model of picalculus early observational equivalence. In Proc. CONCUR’02, LNCS 2421, pages 449–465. 2. G. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph
PROFUNDIS Deliverable 11: Summary of Dissemination Activities Year 1
, 2003
"... The main form of dissemination for PROFUNDIS at this stage is through publications in scientific conferences, workshops and journals. Here we have been successful with 18 peer reviewed publications and several other reports. There has been one general PROFUNDIS workshop, two minor project meetings o ..."
Abstract
 Add to MetaCart
The main form of dissemination for PROFUNDIS at this stage is through publications in scientific conferences, workshops and journals. Here we have been successful with 18 peer reviewed publications and several other reports. There has been one general PROFUNDIS workshop, two minor project meetings on particalar topics, and seven visits between partners. These indirectly contribute also to dissemination outside the project, since visitors often give presentations attracting an audience from outside the project. There have been 16 visits from project members to sites outside the project in order to present parts of the project. These visits range from invited talks at conferences to more informal presentations. A website with links to papers and tools has been created. 2 Overview of the Work Packages PROFUNDIS consists of three technical Work Packages (WPs) outlined below. A fourth WP is devoted to project management and is given no special consideration in the DUP. WP1 The objectives of the work package consist of the development of a HDAutomata model, suitable for finitestate verification, enhanced with additional capabilities like name fusions and substitutions. Also, versions of 2