|
Published Articles >> Table of Contents >> Abstract
Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06)
pp. 389-398
Modeling Workflows with Recursive ECATNets
Awatef Hicheur, CEDRIC-CNAM Paris France
Kamel Barkaoui, CEDRIC-CNAM Paris France
Noura Boudiaf, CEDRIC-CNAM Paris France
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2006.52
Send link to a friend
| Abstract |
|
A major limitation of current workflow management
systems appears in (1) their lack of support for flexible
workflows whose structures can be modified
dynamically during the execution and (2) in their
failure in dealing, efficiently, with the most advanced
workflow patterns. In this paper, we propose a new
model which we call recursive ECATNets
(RECATNets) to model workflow processes with
dynamic structure and, particularly, to handle the most
complex workflow patterns, in a concise way. The
RECATNets extend classical ECATNets (Extended
Concurrent Algebraic Term Nets) with the recursion
concept firstly introduced in the recursive Petri nets.
We define the semantics of RECATNets in the
conditional rewriting logic framework. Rewriting logic
is a true concurrency and operational semantics which
allows rapid prototyping using rewriting techniques
and the system Maude in particular.
|
 Additional Information
|
Citation:
Awatef Hicheur, Kamel Barkaoui, Noura Boudiaf,
"Modeling Workflows with Recursive ECATNets,"
synasc,
pp. 389-398,
Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06),
2006
|
|
