A logic-based calculus of events
New Generation Computing
Model checking
Proceedings of the Conference on Logic of Programs
Automata-Based Verification of Temporal Properties on Running Programs
Proceedings of the 16th IEEE international conference on Automated software engineering
Compliance checking between business processes and business contracts
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
DECLARE: Full Support for Loosely-Structured Processes
EDOC '07 Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference
Efficient Compliance Checking Using BPMN-Q and Temporal Logic
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Verification of Choreographies During Execution Using the Reactive Event Calculus
Web Services and Formal Methods
Change patterns and change support features in process-aware information systems
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
Comparing LTL Semantics for Runtime Verification
Journal of Logic and Computation
Beyond process mining: from the past to present and future
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Modeling and verification of a protocol for operational support using coloured petri nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Better algorithms for analyzing and enacting declarative workflow languages using LTL
BPM'11 Proceedings of the 9th international conference on Business process management
A declarative approach for flexible business processes management
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
Monitoring business process compliance using compliance rule graphs
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
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
Patterns for a log-based strengthening of declarative compliance models
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Specifying and verifying declarative fluent temporal logic properties of workflows
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
On enabling compliance of cross-organizational business processes
BPM'13 Proceedings of the 11th international conference on Business Process Management
Mixing paradigms for more comprehensible models
BPM'13 Proceedings of the 11th international conference on Business Process Management
International Journal of Web Services Research
Monitoring business constraints with the event calculus
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Information and Software Technology
Hi-index | 0.00 |
Today's information systems record real-time information about business processes. This enables the monitoring of business constraints at runtime. In this paper, we present a novel runtime verification framework based on linear temporal logic and colored automata. The framework continuously verifies compliance with respect to a predefined constraint model. Our approach is able to provide meaningful diagnostics even after a constraint is violated. This is important as in reality people and organizations will deviate and in many situations it is not desirable or even impossible to circumvent constraint violations. As demonstrated in this paper, there are several approaches to recover after the first constraint violation. Traditional approaches that simply check constraints are unable to recover after the first violation and still foresee (inevitable) future violations. The framework has been implemented in the process mining tool ProM.