Skip to main content

Extending Temporal Business Constraints with Uncertainty

  • Conference paper
  • First Online:
Business Process Management (BPM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12168))

Included in the following conference series:

Abstract

Temporal business constraints have been extensively adopted to declaratively capture the acceptable courses of execution in a business process. However, traditionally, constraints are interpreted logically in a crisp way: a process execution trace conforms with a constraint model if all the constraints therein are satisfied. This is too restrictive when one wants to capture best practices, constraints involving uncontrollable activities, and exceptional but still conforming behaviors. This calls for the extension of business constraints with uncertainty. In this paper, we tackle this timely and important challenge, relying on recent results on probabilistic temporal logics over finite traces. Specifically, our contribution is threefold. First, we delve into the conceptual meaning of probabilistic constraints and their semantics. Second, we argue that probabilistic constraints can be discovered from event data using existing techniques for declarative process discovery. Third, we study how to monitor probabilistic constraints, where constraints and their combinations may be in multiple monitoring states at the same time, though with different probabilities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Recall that a \(\mathsf {response}\) constraint is satisfied if every execution of the source is followed by the execution of the target.

  2. 2.

    Implausible scenarios are irrelevant: they produce an output that is associated to probability 0.

  3. 3.

    https://bitbucket.org/fmmaggi/probabilisticmonitor/src/master/.

  4. 4.

    http://lpsolve.sourceforge.net/5.5/.

  5. 5.

    In the screenshots, 1 and 2 represent the probabilistic constraints labeled with 1 and 2 in Fig.Ā 2, whereas 3 represents the crisp constraint in the same example.

References

  1. De Giacomo, G., De Masellis, R., Grasso, M., Maggi, F.M., Montali, M.: Monitoring business metaconstraints Based on LTL and LDL for finite traces. In: Sadiq, S., Soffer, P., Vƶlzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 1ā€“17. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10172-9_1

    ChapterĀ  Google ScholarĀ 

  2. De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, 3ā€“9 August 2013, pp. 854ā€“860 (2013). http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6997

  3. De Masellis, R., Maggi, F.M., Montali, M.: Monitoring data-aware business constraints with finite state automata. In: International Conference on Software and Systems Process 2014, ICSSP 2014, Nanjing, China, 26ā€“28 May 2014, pp. 134ā€“143 (2014). https://doi.org/10.1145/2600821.2600835

  4. Di Ciccio, C., Maggi, F.M., Montali, M., Mendling, J.: Ensuring model consistency in declarative process discovery. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 144ā€“159. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23063-4_9

    ChapterĀ  Google ScholarĀ 

  5. Di Ciccio, C., Maggi, F.M., Montali, M., Mendling, J.: Resolving inconsistencies and redundancies in declarative process models. Inf. Syst. 64, 425ā€“446 (2017). https://doi.org/10.1016/j.is.2016.09.005

    ArticleĀ  Google ScholarĀ 

  6. Di Ciccio, C., Maggi, F.M., Montali, M., Mendling, J.: On the relevance of a business constraint to an event log. Inf. Syst. 78, 144ā€“161 (2018). https://doi.org/10.1016/j.is.2018.01.011

    ArticleĀ  Google ScholarĀ 

  7. Di Ciccio, C., Mecella, M.: On the discovery of declarative control flows for artful processes. ACM Trans. Manag. Inf. Syst. 5(4), 24:1ā€“24:37 (2015). https://doi.org/10.1145/2629447

    ArticleĀ  Google ScholarĀ 

  8. Kovtunova, A., PeƱaloza, R.: Cutting diamonds: a temporal logic with probabilistic distributions. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 Octoberā€“2 November 2018, pp. 561ā€“570 (2018). https://aaai.org/ocs/index.php/KR/KR18/paper/view/18037

  9. Lamma, E., Mello, P., Montali, M., Riguzzi, F., Storari, S.: Inducing declarative logic-based models from labeled traces. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 344ā€“359. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75183-0_25

    ChapterĀ  Google ScholarĀ 

  10. Leemans, S.J.J., Polyvyanyy, A.: Stochastic-aware conformance checking: an entropy-based approach. In: Dustdar, S., Yu, E., Salinesi, C., Rieu, D., Pant, V. (eds.) CAiSE 2020. LNCS, vol. 12127, pp. 217ā€“233. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-49435-3_14

    ChapterĀ  Google ScholarĀ 

  11. Leemans, S.J.J., Syring, A.F., van der Aalst, W.M.P.: Earth moversā€™ stochastic conformance checking. In: Hildebrandt, T., van Dongen, B.F., Rƶglinger, M., Mendling, J. (eds.) BPM 2019. LNBIP, vol. 360, pp. 127ā€“143. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-26643-1_8

    ChapterĀ  Google ScholarĀ 

  12. Ly, L.T., Maggi, F.M., Montali, M., Rinderle-Ma, S., van der Aalst, W.M.P.: Compliance monitoring in business processes: functionalities, application, and tool-support. Inf. Syst. 54, 209ā€“234 (2015). https://doi.org/10.1016/j.is.2015.02.007

    ArticleĀ  Google ScholarĀ 

  13. Maggi, F.M., Bose, R.P.J.C., van der Aalst, W.M.P.: Efficient discovery of understandable declarative process models from event logs. In: RalytĆ©, J., Franch, X., Brinkkemper, S., Wrycza, S. (eds.) CAiSE 2012. LNCS, vol. 7328, pp. 270ā€“285. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31095-9_18

    ChapterĀ  Google ScholarĀ 

  14. Maggi, F.M., Montali, M., van der Aalst, W.M.P.: An operational decision support framework for monitoring business constraints. In: de Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 146ā€“162. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28872-2_11

    ChapterĀ  Google ScholarĀ 

  15. Maggi, F.M., Montali, M., PeƱaloza, R.: Temporal logics over finite traces with uncertainty. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, 7ā€“12 February 2020, pp. 10218ā€“10225 (2020). https://aaai.org/ojs/index.php/AAAI/article/view/6583

  16. 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). https://doi.org/10.1007/978-3-642-23059-2_13

    ChapterĀ  Google ScholarĀ 

  17. Maggi, F.M., Westergaard, M., Montali, M., van der Aalst, W.M.P.: Runtime verification of LTL-based declarative process models. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 131ā€“146. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29860-8_11

    ChapterĀ  Google ScholarĀ 

  18. Montali, M.: Specification and Verification of Declarative Open Interaction Models: a Logic-Based Approach. LNBIP, vol. 56. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14538-4

    BookĀ  MATHĀ  Google ScholarĀ 

  19. Montali, M., Pesic, M., van der Aalst, W.M.P., Chesani, F., Mello, P., Storari, S.: Declarative specification and verification of service choreographies. ACM Trans. Web 4(1), 3:1ā€“3:62 (2010). https://doi.org/10.1145/1658373.1658376

    ArticleĀ  Google ScholarĀ 

  20. Ognjanovic, Z.: Discrete linear-time probabilistic logics: completeness, decidability and complexity. J. Log. Comput. 16(2), 257ā€“285 (2006). https://doi.org/10.1093/logcom/exi077

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  21. Pesic, M., Schonenberg, H., van der Aalst, W.M.P.: Declare: full support for loosely-structured processes. In: 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 15ā€“19 October 2007, Annapolis, Maryland, USA, pp. 287ā€“300. IEEE Computer Society (2007). https://doi.org/10.1109/EDOC.2007.14

  22. Schƶnig, S., Rogge-Solti, A., Cabanillas, C., Jablonski, S., Mendling, J.: Efficient and customisable declarative process mining with SQL. In: Nurcan, S., Soffer, P., Bajec, M., Eder, J. (eds.) CAiSE 2016. LNCS, vol. 9694, pp. 290ā€“305. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39696-5_18

    ChapterĀ  Google ScholarĀ 

Download references

Acknowledgments

This work has been supported by the Estonian Research Council (project PRG887).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabrizio Maria Maggi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Maggi, F.M., Montali, M., PeƱaloza, R., Alman, A. (2020). Extending Temporal Business Constraints with Uncertainty. In: Fahland, D., Ghidini, C., Becker, J., Dumas, M. (eds) Business Process Management. BPM 2020. Lecture Notes in Computer Science(), vol 12168. Springer, Cham. https://doi.org/10.1007/978-3-030-58666-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58666-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58665-2

  • Online ISBN: 978-3-030-58666-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics