Results 1  10
of
42
Probabilistic QoS and Soft Contracts for TransactionBased Web Services Orchestrations
 IEEE Trans. on Services Computing
, 2008
"... Abstract—Service level agreements (SLAs), or contracts, have an important role in Web services. These contracts define the obligations and rights between the provider of a Web service and its client, with respect to the function and the Quality of Service (QoS). For composite services like orchestra ..."
Abstract

Cited by 43 (17 self)
 Add to MetaCart
(Show Context)
Abstract—Service level agreements (SLAs), or contracts, have an important role in Web services. These contracts define the obligations and rights between the provider of a Web service and its client, with respect to the function and the Quality of Service (QoS). For composite services like orchestrations, such contracts are deduced by a process called QoS contract composition, based on contracts established between the orchestration and the called Web services. These contracts are typically stated in the form of hard guarantees (e.g., response time always less than 5 msec). Using hard bounds is not realistic, however, and more statistical approaches are needed. In this paper, we propose using soft probabilistic contracts instead, which consist of a probability distribution for the considered QoS parameter—in this paper, we focus on timing. We show how to compose such contracts to yield a global probabilistic contract for the orchestration. Our approach is implemented by the TOrQuE tool. Experiments on TOrQuE show that overly pessimistic contracts can be avoided and significant room for safe overbooking exists. An essential component of SLA management is then the continuous monitoring of the performance of called Web services to check for violations of the agreed SLA. We propose a statistical technique for runtime monitoring of soft contracts.
Unfoldingbased diagnosis of systems with an evolving topology
, 2008
"... Abstract. We propose a framework for modelbased diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, modelbased diagnosis is aimed at constructing explanations of observed faulty behaviours on the basis of a given model of the sy ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a framework for modelbased diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, modelbased diagnosis is aimed at constructing explanations of observed faulty behaviours on the basis of a given model of the system. Since the number of possible explanations may be huge we exploit the unfolding as a compact data structure to store them, along the lines of previous work dealing with Petri net models. Given a model of a system and an observation, the explanations can be constructed by unfolding the model constrained by the observation, and then removing incomplete explanations in a pruning phase. The theory is formalised in a general categorical setting: constraining the system by the observation corresponds to taking a product in the chosen category of graph grammars, so that the correctness of the procedure can be proved by using the fact that the unfolding is a right adjoint and thus it preserves products. The theory thus should be easily applicable to a wide class of system models, including graph grammars and Petri nets. 1
McMillan’s complete prefix for contextual nets
, 2007
"... In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used for verification purposes. Contextual nets are a generalisation of Petri nets suited to model systems with readonly access to re ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
(Show Context)
In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used for verification purposes. Contextual nets are a generalisation of Petri nets suited to model systems with readonly access to resources. When working with contextual nets, a finite complete prefix can be obtained by applying McMillan’s construction to a suitable encoding of the contextual net into an ordinary net. However, it has been observed that if the unfolding is itself a contextual net, then the complete prefix can be significantly smaller than the one obtained with the above technique. A construction for generating such a contextual complete prefix has been proposed for a special class of nets, called readpersistent. In this paper we propose an algorithm that works for arbitrary semiweighted, bounded contextual nets. The construction explicitly takes into account the fact that, unlike in ordinary or readpersistent nets, an event can have several different histories in general contextual net computations.
Complete finite prefixes of symbolic unfoldings of safe time Petri nets
 In ICATPN, volume 4024 of LNCS
, 2006
"... Abstract. Monitoring realtime concurrent systems is a challenging task. In this paper we formulate (modelbased) supervision by means of hidden state history reconstruction, from event (e.g. alarm) observations. We follow a socalled true concurrency approach using time Petri nets: the model define ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
(Show Context)
Abstract. Monitoring realtime concurrent systems is a challenging task. In this paper we formulate (modelbased) supervision by means of hidden state history reconstruction, from event (e.g. alarm) observations. We follow a socalled true concurrency approach using time Petri nets: the model defines explicitly the causal and concurrency relations between the observable events, produced by the system under supervision on different points of observation, and constrained by time aspects. The problem is to compute onthefly the different partial order histories, which are the possible explanations of the observable events. We do not impose that time is observable: the aim of supervision is to infer the partial ordering of the events and their possible firing dates. This is achieved by considering a model of the system under supervision, given as a time Petri net, and the onthefly construction of an unfolding, guided by the observations. Using a symbolic representation, this paper presents a new definition of the unfolding of time Petri nets with dense time.
Time Supervision of Concurrent Systems using Symbolic Unfoldings of Time Petri Nets
, 2005
"... ..."
Unfolding Semantics of Graph Transformation
, 2007
"... Several attempts have been made of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets, but only partial results were obtained. In this paper we fully extend Winskel’s approach to singlepushout grammars providing them with a categorical concurre ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
Several attempts have been made of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets, but only partial results were obtained. In this paper we fully extend Winskel’s approach to singlepushout grammars providing them with a categorical concurrent semantics expressed as a
Event Structure Semantics for Nominal Calculi
 Proceedings of CONCUR 2006, 17th International Conference on Concurrency Theory, Lecture Notes in Computer Science
, 2006
"... Abstract. Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal calculi have been modeled with graph grammars, and hence their event structure semantics could be obtained as i ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal calculi have been modeled with graph grammars, and hence their event structure semantics could be obtained as instances of the general case, the main limitation is that in the case of graph grammars the construction is more complex than strictly necessary for dealing with usual nominal calculi and, speaking in categorical terms, it is not as elegant as in the case of Petri nets. The main contribution of this work is the definition of a particular class of graph grammars, called persistent, that are expressive enough to model name passing calculi while simplifying the denotational domain construction, which can be expressed as an adjunction. Finally, we apply our technique to derive event structure semantics for picalculus and joincalculus processes. 1
Models for the supervision of web services orchestration with dynamic changes
 In AICT/SAPIR/ELETE
, 2005
"... Programming on the Web enlights some classical problems encountered on large distributed applications with a particular emphasis on dynamic changes. In that context, we are interested in the questions of supervision and diagnosis. Our approach is based on trueconcurrency models and consists in buil ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Programming on the Web enlights some classical problems encountered on large distributed applications with a particular emphasis on dynamic changes. In that context, we are interested in the questions of supervision and diagnosis. Our approach is based on trueconcurrency models and consists in building an unfolding of a model of the supervised system, that selects the histories that explain the observed alarms. In this paper we extend the notion of unfolding of highlevel Petri nets to a model of dynamic systems that we define. This model is close to highlevel Petri nets and allows us to model dynamicity. Finally we explain how to use unfoldings of dynamic nets for the diagnosis application. 1.
Coreflective concurrent semantics for singlepushout graph grammars
 Workshop on Algebraic Development Techniques (WADT02), volume 2755 of Lecture Notes in Computer Science
, 2003
"... Abstract. The problem of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets has been faced several times along the years, both for the singlepushout and doublepushout approaches, but only partial results were obtained. In this paper we fully e ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The problem of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets has been faced several times along the years, both for the singlepushout and doublepushout approaches, but only partial results were obtained. In this paper we fully extend Winskel's approach to singlepushout grammars providing them with a categorical concurrent semantics expressed as a coreflection between the category of graph grammars and the category of prime algebraic domains. Introduction It belongs to the folklore that Graph Grammars [25] generalise Petri nets, in that they allow for a more structured representation of system states, modelled in terms of graphs rather than (multi)sets, and for a more general kind of state transformation, modelling also preservation of parts of the state, besides deletion and creation.