Sciweavers

22 search results - page 2 / 5
» Executable Semantics for Compensating CSP
Sort
View
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
13 years 11 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
EUROMICRO
1999
IEEE
13 years 11 months ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen
ANSS
2008
IEEE
14 years 1 months ago
Executable Protocol Models as a Requirements Engineering Tool
Functional prototypes and simulations are a well recognised and valued tool for building a shared understanding of requirements between users and developers. However, the developm...
Ashley T. McNeile, Ella E. Roubtsova
ATAL
2007
Springer
14 years 1 months ago
ARTS: agent-oriented robust transactional system
This paper presents the ARTS (Agent-oriented Robust Transactional System) model, which applies transaction concepts to provide agent developers with high-level support for agent s...
Mingzhong Wang, Amy Unruh, Kotagiri Ramamohanarao
BPM
2005
Springer
129views Business» more  BPM 2005»
14 years 29 days ago
Transforming BPEL to Petri Nets
We present a Petri net semantics for the Business Process Execution Language for Web Services (BPEL). Our semantics covers the standard behaviour of BPEL as well as the exceptional...
Sebastian Hinz, Karsten Schmidt 0004, Christian St...