Event structure semantics of Orc

  • Authors:

  • Sidney Rosario;David Kitchin;Albert Benveniste;William Cook;Stefan Haar;Claude Jard

  • Affiliations:

  • Irisa, Inria, Rennes cedex, France;The University of Texas at Austin, Department of Computer Sciences, Austin;Irisa, Inria, Rennes cedex, France;The University of Texas at Austin, Department of Computer Sciences, Austin;Irisa, Inria Rennes and SITE, University of Ottawa, Canada;Irisa, ENS Cachan, Rennes cedex, France

  • Venue:
  • WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Developing wide-area distributed applications requires jointly analyzing functional and Quality of Service (QoS) aspects, such as timing properties. Labelled transition systems and sequential trace semantics - the common semantic domains - do not facilitate this kind of analysis because they do not precisely express the causal relationships between events. Asymmetric Event Structures (AES) provide an explicit representation of the causal dependencies between events in the execution of a system and allow for an elegant coding of preemption. Event structures are, however, difficult to construct compositionally, because they cannot easily represent fragments of a computation. The heaps we develop here allow for such a representation, and easily generate AES. In this paper, we develop a partial-order semantics in terms of heaps, for Orc, an orchestration language used to describe distributed computations over the internet. We briefly show how Orc, and this new semantics, are used for QoS studies of wide area orchestrations.