Pervasive computing environments such as our future homes are the prototypical example of a dynamic, complex systemwhere ServiceOriented Computing techniques will play an important role. A home equipped with heterogeneous devices, whose services and location constantly change, needs to behave as a coherent system supporting its inhabitants. In this paper, we present a fully implemented architec...

This paper provides new insight into the connection between the trace-based lower part of van Glabbeek’s linear-time, branchingtime spectrum and its simulation-based upper part. We establish that ready simulation is fully abstract with respect to failures inclusion, when adding the conjunction operator that was proposed by the authors in [TCS 373(1–2):19–40] to the standard setting of labelled ...

The first precise description of a version of the BorowskyGafni fault-tolerant simulation algorithm is given, along with a careful description of what it accomplishes and a proof of correctness. The algorithm implements a notion of fault-tolerant reducibility between decision problems. This notion of reducibility is defined, and examples of its use are provided. The algorithm is presented and v...

The new paradigm for distributed computing over the Internet is that of Web services. They are Web accessible software components which can be combined and linked together to create new functionality in the form of Web processes. This also creates the need to compose services into processes that are efficient in terms of their performance. In this work, we describe our Service Composition and E...

Several scienti c bottlenecks have been identi ed in existing component-based approaches. Among them, we focus on the identi cation of a relevant abstraction for the component expression and veri cation of properties like substitutivity: When is it possible to formally accept or reject the substitution of a component in a composition? This paper suggests integer weighted automata to tackle this...

This work is an introduction to the author’s contributions to the SOC area, resulting from his PhD research activity. It focuses on the problem of automatically composing a desired service, given a set of available ones and a target specification. As for description, services are represented as finite-state transition systems, so to provide an abstract account of their behavior, seen as the set...

As the number of available models as well as their complexity grows, model reuse becomes increasingly interesting. However, building new models based on reusing existing ones poses several challenges, and among others, checking validity of the newly built model and the model reuse is of paramount importance. The modeling process is typically accompanied by executing simulation experiments, e.g....

In this paper, we suggest an automatic technique for checking the timed weak simulation between timed transition systems. The technique is an observation-based method in which two timed transition systems are composed with a timed observer. A μ-calculus property that captures the timed weak simulation is then verified on the result of the composition. An interesting feature of the suggested tec...

The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interfa...