Results 1 
5 of
5
A.: Graphical encoding of a spatial logic for the πcalculus
, 2007
"... Abstract. This paper extends our graphbased approach to the verification of spatial properties of πcalculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped with respect to the usual structural congruence, i.e., two processes are equivalent exac ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. This paper extends our graphbased approach to the verification of spatial properties of πcalculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of πcalculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula. 1
A connector algebra for P/T nets interactions
 CONCUR, volume 6901 of LNCS
, 2011
"... Abstract. A quite flourishing research thread in the recent literature on componentbased system is concerned with the algebraic properties of various kinds of connectors for defining wellengineered systems. In a recent paper, an algebra of stateless connectors was presented that consists of five k ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. A quite flourishing research thread in the recent literature on componentbased system is concerned with the algebraic properties of various kinds of connectors for defining wellengineered systems. In a recent paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, plus their duals. The connectors can be composed in series or in parallel and employing a simple 1state buffer they can model the coordination language Reo. Pawel Sobocinski employed essentially the same stateful extension of connector algebra to provide semanticspreserving mutual encoding with some sort of elementary Petri nets with boundaries. In this paper we show how the tile model can be used to extend Sobocinski’s approach to deal with P/T nets, thus paving the way towards more expressive connector models. 1
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
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
 Add to MetaCart
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
On hierarchical graphs: reconciling bigraphs, gsmonoidal theories and gsgraphs ⋆
"... Abstract. Compositional graph models for global computing systems must account for two relevant dimensions, namely nesting and linking. In Milner’s bigraphs the two dimensions are made explicit and represented as loosely coupled structures: the place graph and the link graph. Here, bigraphs are comp ..."
Abstract
 Add to MetaCart
Abstract. Compositional graph models for global computing systems must account for two relevant dimensions, namely nesting and linking. In Milner’s bigraphs the two dimensions are made explicit and represented as loosely coupled structures: the place graph and the link graph. Here, bigraphs are compared with an earlier model, gsgraphs, based on gsmonoidal theories and originally conceived for modelling the syntactical structure of agents with αconvertible declarations. We show that gsgraphs are quite convenient also for the new purpose, since the two dimensions can be recovered by introducing two types of nodes. With respect to bigraphs, gsgraphs can be proved essentially equivalent, with minor differences at the interface level. We argue that gsgraphs have a simpler and more standard algebraic structure for representing both states and transitions, and can be equipped with a simple type system (in the style of relational separation logic) to check the wellformedness of bounded gsgraphs. Another advantage concerns a textual form in terms of sets of assignments, which can make implementation easier in rewriting frameworks like Maude. Vice versa, the reactive system approach developed for bigraphs needs yet to be addressed in gsgraphs. 1