skip to main content
research-article

Monitoring business constraints with the event calculus

Published:03 January 2014Publication History
Skip Abstract Section

Abstract

Today, large business processes are composed of smaller, autonomous, interconnected subsystems, achieving modularity and robustness. Quite often, these large processes comprise software components as well as human actors, they face highly dynamic environments and their subsystems are updated and evolve independently of each other. Due to their dynamic nature and complexity, it might be difficult, if not impossible, to ensure at design-time that such systems will always exhibit the desired/expected behaviors. This, in turn, triggers the need for runtime verification and monitoring facilities. These are needed to check whether the actual behavior complies with expected business constraints, internal/external regulations and desired best practices. In this work, we present Mobucon EC, a novel monitoring framework that tracks streams of events and continuously determines the state of business constraints. In Mobucon EC, business constraints are defined using the declarative language Declare. For the purpose of this work, Declare has been suitably extended to support quantitative time constraints and non-atomic, durative activities. The logic-based language Event Calculus (EC) has been adopted to provide a formal specification and semantics to Declare constraints, while a light-weight, logic programming-based EC tool supports dynamically reasoning about partial, evolving execution traces. To demonstrate the applicability of our approach, we describe a case study about maritime safety and security and provide a synthetic benchmark to evaluate its scalability.

References

  1. Artikis, A. and Paliouras, G. 2009. Behaviour recognition using the event calculus. In Artificial Intelligence Applications and Innovations III, Springer, 469--478.Google ScholarGoogle Scholar
  2. Bauer, A., Leucker, M., and Schallhart, C. 2007. The good, the bad, and the ugly, but how ugly is ugly? In Proceedings of the International Workshop on Runtime Verification. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bauer, A., Leucker, M., and Schallhart, C. 2011. Runtime verification for LTL and TLTL. ACM Trans. Softw. Engin. Methodol. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bragaglia, S., Chesani, F., Mello, P., Montali, M., and Torroni, P. 2012. Reactive event calculus for monitoring global computing applications. In Logic Programs, Norms and Action, Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chesani, F., Mello, P., Montali, M., and Torroni, P. 2009. Verification of choreographies during execution using the reactive event calculus. In Proceedings of the Conference on Web Services and Formal Methods. Springer, 55--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chesani, F., Mello, P., Montali, M., and Torroni, P. 2010. A logic-based, reactive calculus of events. Fundamenta Informaticae 1--2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Chittaro, L. and Montanari, A. 1996. Efficient temporal reasoning in the cached event calculus. Comput. Intell. 12.Google ScholarGoogle Scholar
  8. Clark, K. L. 1978. Negation as failure. In Logic and Data Bases, Plenum Press, 293--322.Google ScholarGoogle Scholar
  9. Dustdar, S. and Gombotz, R. 2006. Discovering web service workows using web services interaction mining. Int. J. Business Process Integr. Manage.Google ScholarGoogle Scholar
  10. Farrell, A. D. H., Sergot, M. J., Sallé, M., and Bartolini, C. 2005. Using the event calculus for tracking the normative state of contracts. Coop. Inf. Syst. 2--3.Google ScholarGoogle Scholar
  11. Giannakopoulou, D. and Havelund, K. 2001. Automata-based verification of temporal properties on running programs. In Proceedings of the 16th Annual International Conference on Automated Software Engineering (ASE'01). IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. International Telecommunications Union 2001. 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, International Telecommunications Union.Google ScholarGoogle Scholar
  13. Kowalski, R. A. and Sergot, M. J. 1986. A logic-based calculus of events. New Generation Comput. 4, 1, 67--95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Luckham, D. 2001. The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems. Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Maggi, F. M., Bose, R. P. J. C., and van der Aalst, W. M. P. 2012. Efficient discovery of understandable declarative models from event logs. In Proceedings of the 24th International Conference on Advanced Information Systems Engineering. J. Ralyté, X. Franch, S. Brinkkemper, and S. Wrycza, Eds., Lecture Notes in Computer Science, vol. 7328, Springer, 270--285. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Maggi, F. M., Montali, M.,Westergaard, M., and van der Aalst, W. M. P. 2011. Monitoring business constraints with linear temporal logic: An approach based on colored automata. In Proceedings of the International Conference on Business Process Management, Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Maggi, F. M., Mooij, A. J., and van der Aalst, W. M. P. 2012. Analyzing vessel behavior using process mining. Poseidon. (To Appear).Google ScholarGoogle Scholar
  18. Maggi, F. M., Westergaard, M., Montali, M., and van der Aalst, W. M. P. 2012. Runtime verification of ltl-based declarative process models. In Proceedings of the International Workshop on Runtime Verification, Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Montali, M. 2010. Specification and Verification of Declarative Open Interaction Models: a Logic-Based Approach. Lecture Notes in Business Information Processing, vol. 56, Springer.Google ScholarGoogle Scholar
  20. Montali, M., Chesani, F., Maggi, F. M., and Mello, P. 2013. Towards data-aware constraints in declare. In Proceedings of the ACM Symposium on Applied Computing. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Montali, M., Pesic, M., van der Aalst, W. M. P., Chesani, F., Mello, P., and Storari, S. 2010. Declarative specification and verification of service choreographies. ACM Trans. Web 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Nezhad, H. R. M., Saint-Paul, R., Casati, F., and Benatallah, B. 2011. Event correlation for process discovery from web service interaction logs. VLDB J. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Pauw, W., Lei, M., Pring, E., Villard, L., Arnold, M., and Morar, J. 2005. Web services navigator: Visualizing the execution of web services. IBM Syst. J. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Pesic, M. 2008. Constraint-based workflow management systems: Shifting controls to users. Ph.D. thesis, Beta Research School for Operations Management and Logistics, Eindhoven.Google ScholarGoogle Scholar
  25. Pesic, M., Schonenberg, H., and van der Aalst, W. M. P. 2007. Declare: Full support for loosely structured processes. In Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC'07). IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Pesic, M. and van der Aalst, W. M. P. 2006. A declarative approach for flexible business processes management. In Proceedings of the International Conference on Business Process Management Workshops, Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Sadri, F. and Kowalski, R. A. 1995. Variants of the event calculus. In Proceedings of the International Conference on Logic Programming. MIT Press.Google ScholarGoogle Scholar
  28. Shanahan, M. 1999. The event calculus explained. In Artificial Intelligence Today: Recent Trends and Developments, Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Spanoudakis, G. and Mahbub, K. 2006. Non-intrusive monitoring of service-based systems. Coop. Inf. Syst. 3, 325--358.Google ScholarGoogle ScholarCross RefCross Ref
  30. van der Aalst, W. M. P. 2011. Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer. Google ScholarGoogle ScholarCross RefCross Ref
  31. van der Aalst, W. M. P., van Hee, K. M., van der Werf, J. M. E. M., and Verdonk, M. 2010. Auditing 2.0: Using process mining to support tomorrow's auditor. IEEE Computer 43, 3. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Verbeek, E., Buijs, J., van Dongen, B., and van der Aalst, W. 2010. ProM 6: The process mining toolkit. In Proceedings of the International Conference on Business Process Management.Google ScholarGoogle Scholar
  33. Westergaard, M. 2011. Better algorithms for analyzing and enacting declarative workflow languages using ltl. In Proceedings of the International Conference on Business Process Management, Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Monitoring business constraints with the event calculus

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Intelligent Systems and Technology
            ACM Transactions on Intelligent Systems and Technology  Volume 5, Issue 1
            Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
            December 2013
            520 pages
            ISSN:2157-6904
            EISSN:2157-6912
            DOI:10.1145/2542182
            Issue’s Table of Contents

            Copyright © 2014 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 3 January 2014
            • Accepted: 1 February 2013
            • Revised: 1 September 2012
            • Received: 1 August 2012
            Published in tist Volume 5, Issue 1

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader