Runtime verification of LTL-Based declarative process models

Authors:
Fabrizio Maria Maggi;Michael Westergaard;Marco Montali;Wil M. P. van der Aalst
Affiliations:
Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands;KRDB Research Centre, Free University of Bozen-Bolzano, Italy;Eindhoven University of Technology, The Netherlands
Venue:
RV'11 Proceedings of the Second international conference on Runtime verification
Year:
2011

Citing 8
Cited 5

The Glory of the Past

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
DECLARE: Full Support for Loosely-Structured Processes

EDOC '07 Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference
Comparing LTL Semantics for Runtime Verification

Journal of Logic and Computation
Process Mining: Discovery, Conformance and Enhancement of Business Processes

Process Mining: Discovery, Conformance and Enhancement of Business Processes
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
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
Verification and analysis of domain-specific models of physical characteristics in embedded control software

Information and Software Technology
Mixing paradigms for more comprehensible models

BPM'13 Proceedings of the 11th international conference on Business Process Management
Generic and Specific Compatibility Criteria for Web Service Composition: Formal Abstraction and Modular Verification Approach1

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear Temporal Logic (LTL) on finite traces has proven to be a good basis for the analysis and enactment of flexible constraint-based business processes. The Declare language and system benefit from this basis. Moreover, LTL-based languages like Declare can also be used for runtime verification. As there are often many interacting constraints, it is important to keep track of individual constraints and combinations of potentially conflicting constraints . In this paper, we operationalize the notion of conflicting constraints and demonstrate how innovative automata-based techniques can be applied to monitor running process instances. Conflicting constraints are detected immediately and our toolset (realized using Declare and ProM) provides meaningful diagnostics.