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.
|Title of host publication||Runtime Verification (Second International Conference, RV 2011, San Francisco CA, USA, September 27-30, 2011, Revised Selected Papers)|
|Editors||S. Kurshid, K. Sen|
|Place of Publication||Berlin|
|Publication status||Published - 2012|
|Name||Lecture Notes in Computer Science|