Modelling Compensation with Timed Process Algebra

نویسنده

  • Simon D. Foster
چکیده

Compensation is a feature of Business Process Modelling which allows error correction based on non-atomic rollback. Several variant strategies exist for compensation in a similar way that many patterns exist for workflow. Existing formalisations model compensation and workflow in an ad-hoc fashion, mainly due to their high-level nature. In this paper we propose a low-level approach using Timed Process Algebra, which can be extended to model several strategies within a componentoriented framework with compositional semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forgetting the Time in Timed Process Algebra

In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process algebras and partially timed labelled transition systems. We describe these notions, and generalise timed branching bisimilarity to partially timed bra...

متن کامل

Forgetting the Time in Timed Process Algebra Timeless Behaviour in a Timestamped World

In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process algebras and partially timed labelled transition systems. We describe these notions, and generalise timed branching bisimilarity to partially timed bra...

متن کامل

A Timed Process Algebra for Wireless Networks with an Application in Routing⋆

This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast and data structures, which are essential features for the modelling of network protocols. In this framework we model and analyse the Ad hoc On-Demand Distance Vector routing protocol, and show that, contrary to claim...

متن کامل

Introducing monitoring events to timed-CSP

Timed-CSP is a process algebra designed to help in the modelling and analysis of real-time concurrent systems. Timed-CSP can handle synchronisation events that require the cooperation of all the interested parties and broadcasting events which do not require any cooperation from the environment. This paper argues that, still, there are scenarios that can not be adequately modelled in Timed-CSP ...

متن کامل

A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)

This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast and data structures, which are essential features for the modelling of network protocols. In this framework we model and analyse the Ad hoc On-Demand Distance Vector routing protocol, and show that, contrary to claim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007