Abstract. 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.
We present a process algebra suitable to the modelling of timed concurrent systems and to their effi...
Compensation-based long-running transactions (LRTs) are the main error recovery mechanism in busine...
Conversations in service-oriented computation are frequently long running. In such a setting, tradit...
This thesis presents a formal business process modelling language called StAC. The distinctive featu...
AbstractA standard process algebra is extended by a new action σ which is meant to denote idling unt...
AbstractA standard process algebra is extended by a new action σ which is meant to denote idling unt...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
Abstract — In short-lived transactions, database systems ensure atomicity by either committing all o...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
AbstractWe present two formalisations of the Business Process Modelling Notation (BPMN). In particul...
AbstractRecent approaches to the combination of process algebras and temporal logic have shown that ...
Business processes design is an error-prone task often relying on long-running transactions with com...
We present a process algebra suitable to the modelling of timed concurrent systems and to their effi...
Compensation-based long-running transactions (LRTs) are the main error recovery mechanism in busine...
Conversations in service-oriented computation are frequently long running. In such a setting, tradit...
This thesis presents a formal business process modelling language called StAC. The distinctive featu...
AbstractA standard process algebra is extended by a new action σ which is meant to denote idling unt...
AbstractA standard process algebra is extended by a new action σ which is meant to denote idling unt...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
Abstract — In short-lived transactions, database systems ensure atomicity by either committing all o...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
AbstractWe present two formalisations of the Business Process Modelling Notation (BPMN). In particul...
AbstractRecent approaches to the combination of process algebras and temporal logic have shown that ...
Business processes design is an error-prone task often relying on long-running transactions with com...
We present a process algebra suitable to the modelling of timed concurrent systems and to their effi...
Compensation-based long-running transactions (LRTs) are the main error recovery mechanism in busine...
Conversations in service-oriented computation are frequently long running. In such a setting, tradit...