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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Recall that a \(\mathsf {response}\) constraint is satisfied if every execution of the source is followed by the execution of the target.
- 2.
Implausible scenarios are irrelevant: they produce an output that is associated to probability 0.
- 3.
- 4.
- 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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
Acknowledgments
This work has been supported by the Estonian Research Council (project PRG887).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2020 Springer Nature Switzerland AG
About this paper
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)