Results 1 
7 of
7
Characterizing weakly terminating partners of open systems
, 2013
"... Abstract. We study open systems modeled as finite state machines with an interface for asynchronous communication with other open systems. An open system P is a partner of an open system S, if the two systems can be composed to a closed system S ⊕ P that is weakly terminating (does not have deadlock ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We study open systems modeled as finite state machines with an interface for asynchronous communication with other open systems. An open system P is a partner of an open system S, if the two systems can be composed to a closed system S ⊕ P that is weakly terminating (does not have deadlocks nor livelocks). Known controller synthesis techniques allow us to construct a most permissive partner MP(S) to a given open system S. Our contribution is to enhance MP(S) with Boolean annotations, yielding a finite characterization of all partners of S. We demonstrate the usefulness of this characterization by involving it in a decision procedure for accordance. Accordance is a canonical preorder on open systems: R accords with S if every partner of S is a partner of R. Our decision procedure reduces accordance to finding a simulation relation between MP(S) and MP(R) and checking validity of implications between related Boolean formulas.
Frm Ptr Nts t Grph Trnsfrmtn Sstms  A Contribution in Honour of HansJörg Kreowski
, 2009
"... HansJörg Kreowski was among the first researchers to point out that P/T Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithfully into ..."
Abstract
 Add to MetaCart
(Show Context)
HansJörg Kreowski was among the first researchers to point out that P/T Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithfully into Graph Transformation Systems. The key idea we pursue is that the net encoding is uniquely determined, and distinct net models are mapped to alternative approaches to graph transformation.
ECEASST From Petri Nets to Graph Transformation Systems∗
"... Abstract: HansJörg Kreowski was among the first researchers to point out that Place/Transition Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be ..."
Abstract
 Add to MetaCart
Abstract: HansJörg Kreowski was among the first researchers to point out that Place/Transition Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithfully into Graph Transformation Systems. The key idea we pursue is that the net encoding is uniquely determined, and distinct net models are mapped to alternative approaches to graph transformation.
Saturated LTSs for Adhesive Rewriting Systems
, 2010
"... GReactive Systems (GRSs) are a framework for the derivation of labelled transition systems (LTSs) from a set of unlabelled rules. A label for a transition from A to B is a context C[−] such that C[A] may perform a reaction and reach B. If either all contexts, or just the “minimal” ones, are conside ..."
Abstract
 Add to MetaCart
GReactive Systems (GRSs) are a framework for the derivation of labelled transition systems (LTSs) from a set of unlabelled rules. A label for a transition from A to B is a context C[−] such that C[A] may perform a reaction and reach B. If either all contexts, or just the “minimal” ones, are considered, the resulting LTS is called saturated (GIPO, respectively). The borrowed contexts (BCs) technique addresses the issue in the setting of the DPO approach. Indeed, from an adhesive rewriting system (ARS) a GRS can be defined such that DPO derivations correspond to reactions, and BC derivations to transitions of the GIPO LTS. This paper extends the BCs technique in order to derive saturated LTSs for ARSs, applying it to capture bisimilarity for asynchronous calculi.
Modular Encoding of Synchronous and Asynchronous Interactions using Open Petri Nets
"... { fabio,vale} @ di. unipi. it The paper investigates the relationships between two wellknown approaches to the modelling of concurrent and distributed systems, process calculi and Petri nets. A framework for the modular encoding of process calculi into Petri nets is proposed, which is based on a re ..."
Abstract
 Add to MetaCart
(Show Context)
{ fabio,vale} @ di. unipi. it The paper investigates the relationships between two wellknown approaches to the modelling of concurrent and distributed systems, process calculi and Petri nets. A framework for the modular encoding of process calculi into Petri nets is proposed, which is based on a reactive variant of Petri nets. In particular, two exemplary calculi are considered: (asynchronous) CCS and CSP, representing alternative interaction paradigms, namely asynchronous and (broadcast) synchronous communication. The encoding is proved to preserve as well as to reflect the operational semantics. As a consequence, it is wellbehaved with respect to the standard behavioural equivalences such as trace and bisimulation ones, a fact that is exploited to perform a “technology transfer ” between the two formalisms, in terms of un/decidability results for classical properties such as reachability and deadlockfreedom. The encoding highlights the expressiveness of the proposed reactive variant of nets, as well as paving the way for a fruitful integration of tools and techniques between the visual formalism of nets and the algebraic framework of processes.
From Petri Nets to Graph Transformation Systems
, 2010
"... HansJörg Kreowski was among the first researchers to point out that Place/Transition Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded f ..."
Abstract
 Add to MetaCart
HansJörg Kreowski was among the first researchers to point out that Place/Transition Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithfully into Graph Transformation Systems. The key idea we pursue is that the net encoding is uniquely determined, and distinct net models are mapped to alternative approaches to graph transformation.
IOS Press A Netbased Approach to Web Services Publication and Replaceability∗
"... Abstract. Web services represent a promising technology for the development of distributed heterogeneous software systems. In this setting, a major issue is to establish whether two services can be used interchangeably in any context. To this aim, our paper first briefly reviews the results contai ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Web services represent a promising technology for the development of distributed heterogeneous software systems. In this setting, a major issue is to establish whether two services can be used interchangeably in any context. To this aim, our paper first briefly reviews the results contained in a recent article by the same authors, where a suitable notion of behavioural equivalence for Web services was introduced. Our work then extends those results, in order to account for ontologybased service specifications. Next, a concrete example scenario – a car rental system – is presented, and it is then used to illustrate how the equivalence between services can be fruitfully employed for correctly addressing two prominent, modularityrelated problems: the publication of correct service specifications and the replaceability of (sub)services. 1.