Runtime Verification of LTL-Based Declarative Process Models

  • Fabrizio Maria Maggi
  • Michael Westergaard
  • Marco Montali
  • Wil M. P. van der Aalst
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7186)


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.


Monitoring Linear Temporal Logic Finite State Automata Declarative Business Processes Operational Support Process Mining 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    van der Aalst, W.M.P.: Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer, Heidelberg (2011)zbMATHGoogle Scholar
  2. 2.
    Bauer, A., Leucker, M., Schallhart, C.: Comparing LTL Semantics for Runtime Verification. In: Logic and Computation, pp. 651–674 (2010)Google Scholar
  3. 3.
    Giannakopoulou, D., Havelund, K.: Automata-Based Verification of Temporal Properties on Running Programs. In: Proc. ASE, pp. 412–416 (2001)Google Scholar
  4. 4.
    International Telecommunications Union. Technical characteristics for a universal shipborne Automatic Identification System using time division multiple access in the VHF maritime mobile band, Recommendation ITU-R M.1371-1 (2001)Google Scholar
  5. 5.
    Lichtenstein, O., Pnueli, A., Zuck, L.D.: The Glory of the Past. In: Proc. of Logic of Programs, pp. 196–218 (1985)Google Scholar
  6. 6.
    Maggi, F.M., Montali, M., Westergaard, M., van der Aalst, W.M.P.: Monitoring Business Constraints with Linear Temporal Logic: An Approach Based on Colored Automata. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 132–147. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Maggi, F.M., Mooij, A.J., van der Aalst, W.M.P.: User-Guided Discovery of Declarative Process Models. In: Proc. of CIDM, pp. 192–199 (2011)Google Scholar
  8. 8.
    Montali, M., Maggi, F.M., Chesani, F., Mello, P., van der Aalst, W.M.P.: Monitoring Business Constraints with the Event Calculus. Technical Report DEIS-LIA-002-11, University of Bologna, Italy, LIA Series no. 97 (2011)Google Scholar
  9. 9.
    Pesic, M., Schonenberg, H., van der Aalst, W.M.P.: DECLARE: Full Support for Loosely-Structured Processes. In: Proc. of EDOC, pp. 287–300 (2007)Google Scholar
  10. 10.
    Tarjan, R.: Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing, 146–160 (1972)Google Scholar
  11. 11.
    van der Aalst, W.M.P., Pesic, M., Schonenberg, H.: Declarative workflows: Balancing between flexibility and support. Computer Science - R&D (2009)Google Scholar
  12. 12.
    Westergaard, M.: Better Algorithms for Analyzing and Enacting Declarative Workflow Languages Using LTL. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 83–98. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Westergaard, M., Maggi, F.M.: Modelling and Verification of a Protocol for Operational Support using Coloured Petri Nets. In: Proc. of ATPN 2011 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Fabrizio Maria Maggi
    • 1
  • Michael Westergaard
    • 1
  • Marco Montali
    • 2
  • Wil M. P. van der Aalst
    • 1
  1. 1.Eindhoven University of TechnologyThe Netherlands
  2. 2.KRDB Research CentreFree University of Bozen-BolzanoItaly

Personalised recommendations