Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
An Analysis of Bitstate Hashing
Formal Methods in System Design
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
DECLARE: Full Support for Loosely-Structured Processes
EDOC '07 Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference
Workflow simulation for operational decision support
Data & Knowledge Engineering
ASAP: An Extensible Platform for State Space Analysis
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
The Access/CPN Framework: A Tool for Interacting with the CPN Tools Simulator
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection
Transactions on Petri Nets and Other Models of Concurrency III
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
An operational decision support framework for monitoring business constraints
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Runtime verification of LTL-Based declarative process models
RV'11 Proceedings of the Second international conference on Runtime verification
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Information and Software Technology
| Hi-index | 0.00 |
In this paper, we describe the modeling and analysis of a protocol for operational support during workflow enactment. Operational support provides online replies to questions such as "is my execution valid?" and "how do I end the execution in the fastest/cheapest way?", and may be invoked multiple times for each execution. Multiple applications (operational support providers) may be able to answer such questions, so a protocol supporting this should be able to handle multiple providers, maintain data between queries about the same execution, and discard information when it is no longer needed. We present a coloured Petri net model of a protocol satisfying our requirements. The model is used both to make our requirements clear by building a model-based prototype before implementation and to verify that the devised protocol is correct. We present techniques to make analysis of the large state-space of the model possible, including modeling techniques and an improved state representation for coloured Petri nets allowing explicit representation of state spaces with more than 108 states on a normal PC. We briefly describe our implementation in the process mining tool ProM and how we have used it to improve an existing provider.