Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Modeling dynamic objects in distributed systems with nested Petri nets
Fundamenta Informaticae
Flexible Workflow Management in the OPENflow System
EDOC '01 Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing
How to Specify Non-Determinism and True Concurrency with Algebraic Term Nets
Selected papers from the 8th Workshop on Specification of Abstract Data Types Joint with the 3rd COMPASS Workshop on Recent Trends in Data Type Specification
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Model Driven Distribution of Collaborative Business Processes
SCC '06 Proceedings of the IEEE International Conference on Services Computing
Modeling Workflows with Recursive ECATNets
SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Contextual ECATNets Semantics in Terms of Conditional Rewriting Logic
AICCSA '06 Proceedings of the IEEE International Conference on Computer Systems and Applications
Nested nets for adaptive systems
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Modelling collaborative workflows using recursive ECATNets
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Modelling and Analysis of Time-Constrained Flexible Workflows with Time Recursive ECATNets
Web Services and Formal Methods
Hi-index | 0.00 |
In this paper we define a model, namely the recursive ECATNets (Recatnets) based on a sound combination of Extended Concurrent Algebraic Term nets and Recursive Petri nets, allowing a concise modeling of dynamic reconfiguration mechanisms of flexible workflow processes. The descriptive power of Recatnes is well-suited for collaborative workflows modeling. Moreover the use of model checking techniques to prove liveness and safety properties becomes possible due to their semantics defined in conditional rewriting logic.