Workflow Modeling Using Proclets
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
A Region-Based Algorithm for Discovering Petri Nets from Event Logs
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
Towards formal analysis of artifact-centric business process models
BPM'07 Proceedings of the 5th international conference on Business process management
BPM'07 Proceedings of the 2007 international conference on Business process management
Automatic structure-based code generation from coloured Petri nets: a proof of concept
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Process Mining: Discovery, Conformance and Enhancement of Business Processes
Process Mining: Discovery, Conformance and Enhancement of Business Processes
Introducing the guard-stage-milestone approach for specifying business entity lifecycles
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Better algorithms for analyzing and enacting declarative workflow languages using LTL
BPM'11 Proceedings of the 9th international conference on Business process management
Monitoring business constraints with linear temporal logic: an approach based on colored automata
BPM'11 Proceedings of the 9th international conference on Business process management
Runtime verification of LTL-Based declarative process models
RV'11 Proceedings of the Second international conference on Runtime verification
| Hi-index | 0.00 |
Petri nets efficiently model both data- and control-flow. Control-flow is either modeled explicitly as flow of a specific kind of data, or implicit based on the data-flow. Explicit modeling of control-flow is useful for well-known and highly structured processes, but may make modeling of abstract features of models, or processes which are highly dynamic, overly complex. Declarative modeling, such as is supported by Declare and DCR graphs, focus on control-flow, but does not specify it explicitly; instead specifications come in the form of constraints on the order or appearance of tasks. In this paper we propose a combination of the two, using colored Petri nets instead of plain Petri nets to provide full data support. The combined approach makes it possible to add a focus on data to declarative languages, and to remove focus from the explicit control-flow from Petri nets for dynamic or abstract processes. In addition to enriching both procedural processes in the form of Petri nets and declarative processes, we also support a flow from modeling only abstract data- and control-flow of a model towards a more explicit control-flow model if so desired. We define our combined approach, and provide considerations necessary for enactment. Our approach has been implemented in CPN Tools 4.