Monitoring Business Constraints with Linear Temporal Logic: An Approach Based on Colored Automata

  title={Monitoring Business Constraints with Linear Temporal Logic: An Approach Based on Colored Automata},
  author={Fabrizio Maria Maggi and Marco Montali and Michael Westergaard and Wil M.P. van der Aalst},
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… 

Monitoring data-aware business constraints with finite state automata

A novel monitoring approach that tracks streams of process events and verifies if the process execution is compliant with a set of data-aware business constraints, namely constraints not only referring to theporal evolution of events, but also to the temporal evolution of data.

Compliance Monitoring of Multi-Perspective Declarative Process Models

A novel monitoring approach based on MP-Declare, a multi-perspective version of the declarative process modeling language Declare is presented, which has been implemented in the process mining tool ProM and has been experimented using artificial and real-life event logs.

Runtime Verification of LTL-Based Declarative Process Models

This paper operationalizes the notion of conflicting constraints and demonstrates how innovative automata-based techniques can be applied to monitor running process instances to provide meaningful diagnostics.

Extending Temporal Business Constraints with Uncertainty

This paper argues that probabilistic constraints can be discovered from event data using existing techniques for declarative process discovery, and delves into the conceptual meaning of probabilism constraints and their semantics.

Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces

It is shown that LDLf is able to declaratively express, in the logic itself, not only the constraints to be monitored, but also the de-facto standard RV-LTL monitors, and this enables us to directly employ the standard characterization of LDLf based on finite-state automata to monitor constraints in a fine-grained way.

Temporal Logics Over Finite Traces with Uncertainty (Technical Report)

This work proposes a new probabilistic temporal logic over finite traces using superposition semantics, where all possible evolutions are possible, until observed, and studies the properties of the logic and provides automata-based mechanisms for deriving Probabilistic inferences from its formulas.

Runtime detection of business process compliance violations: an approach based on anti patterns

A generic proactive runtime Business Process compliance monitoring framework, BP-MaaS, which incorporates a wide range of expressive high-level compliance patterns for the abstract specification of runtime constraints and could be applied to the checking of compliance in the different phases of the BP lifecycle.

Constructive Trace Validation with Flat Temporal Logic Patterns

  • Computer Science
  • 2013
By restricting LTL formulas to flat, non-nested and right-associative forms, it is obtained a method which provides detailed explanations about the outcome of trace validation in a form comprehensible for the user.

Prognosing the Compliance of Declarative Business Processes Using Event Trace Robustness

This paper proposes the way to determine whether a process instance is robust against a set of compliance rules during its execution at runtime, and thanks to the use of constraint programming and the capacities of super solutions, a robust trace can be guaranteed.

Monitoring business constraints with the event calculus

This work presents Mobucon EC, a novel monitoring framework that tracks streams of events and continuously determines the state of business constraints, using the declarative language Declare, which has been suitably extended to support quantitative time constraints and non-atomic, durative activities.



Efficient Compliance Checking Using BPMN-Q and Temporal Logic

An approach for automated compliance checking of process activities and their ordering is introduced and a set of reduction rules are employed to address the problem of state-space explosion.

Comparing LTL Semantics for Runtime Verification

This work establishes four maxims to be satisfied by any LTL-derived logic aimed at runtime verification, and introduces a new four-valued logic Runtime Verification Linear Temporal Logic RV-LTL in accordance to these maxims.

Modeling and Verification of a Protocol for Operational Support Using Coloured Petri Nets

The modeling and analysis of a protocol for operational support during workflow enactment is described, 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.

Automata-based verification of temporal properties on running programs

  • D. GiannakopoulouK. Havelund
  • Computer Science
    Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001)
  • 2001
An approach to checking a running program against Linear Temporal Logic specifications by translating LTL formulae to finite-state automata, which are used as observers of the program behavior.

A logic-based calculus of events

We outline an approach for reasoning about events and time within a logic programming framework. The notion of event is taken to be more primitive than that of time and both are represented

Model Checking

Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.

DECLARE: Full Support for Loosely-Structured Processes

It is shown how DECLARE can support loosely-structured processes without sacrificing important WFMSs features like user support, model verification, analysis of past executions, changing models at run-time, etc.

A Declarative Approach for Flexible Business Processes Management

This work proposes a fundamental paradigm shift for flexible process management and proposes the ConDec language for modelling and enacting dynamic business processes, based on temporal logic rather than some imperative process modelling language.

Verification of Choreographies During Execution Using the Reactive Event Calculus

A run-time verification method of web service behaviour with respect to choreographies using a reactive version of the Event Calculus based on the computational logic SCIFF framework to enrich DecSerFlow and the EventCalculus with quantitative time constraints and to model compensation actions.

The Glory of the Past

The notion of α-fairness is presented which is proved to fully capture the behavior of probabilistic finite state programs.