Skip to main content

Resource Controllability of Workflows Under Conditional Uncertainty

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

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 362))

Included in the following conference series:

Abstract

An access controlled workflow (ACWF) specifies a set of tasks that have to be executed by authorized users with respect to some partial order in a way that all authorization constraints are satisfied. Recent research focused on weak, strong and dynamic controllability of ACWFs under conditional uncertainty showing that directional consistency is a way to generate any consistent assignment of tasks to users efficiently and without backtracking. This means that during execution we never realize that we would have chosen a different user for some previous task to avoid some constraint violation. However, dynamic controllability of ACWFs also depends on how the components of the ACWF are totally ordered. In this paper, we employ Constraint Networks Under Conditional Uncertainty (CNCUs) to solve this limitation, and provide an encoding from ACWFs into CNCUs to exploit existing controllability checking algorithms for CNCUs. We also address the execution of a controllable ACWF discussing which (possibly different) users are committed for the same tasks depending on what is going on (online planning).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

    SoD is a security policy saying that a subset of tasks must be carried out by different users, whereas BoD says that a subset of tasks must be carried out by the same user.

References

  1. Cabanillas, C., Resinas, M., del-Río-Ortega, A., Cortés, A.R.: Specification and automated design-time analysis of the business process human resource perspective. Inf. Syst. 52, 55–82 (2015). https://doi.org/10.1016/j.is.2015.03.002

    Article  Google Scholar 

  2. Cairo, M., et al.: Incorporating decision nodes into conditional simple temporal networks. In: TIME 2017. vol. 90, pp. 9:1–9:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). https://doi.org/10.4230/LIPIcs.TIME.2017.9

  3. Combi, C., Gambini, M., Migliorini, S., Posenato, R.: Representing business processes through a temporal data-centric workflow modeling language: an application to the management of clinical pathways. IEEE Trans. Syst. Man Cybern. Syst. 44(9), 1182–1203 (2014). https://doi.org/10.1109/TSMC.2014.2300055

    Article  Google Scholar 

  4. Combi, C., Posenato, R.: Controllability in temporal conceptual workflow schemata. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 64–79. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03848-8_6

    Chapter  Google Scholar 

  5. Combi, C., Posenato, R., Viganò, L., Zavatteri, M.: Access controlled temporal networks. In: ICAART 2017. ScitePress (2017). https://doi.org/10.5220/0006185701180131

  6. Combi, C., Posenato, R., Viganò, L., Zavatteri, M.: Conditional simple temporal networks with uncertainty and resources. J. Artif. Intell. Res. 64, 931–985 (2019). https://doi.org/10.1613/jair.1.11453

    Article  MathSciNet  MATH  Google Scholar 

  7. Combi, C., Viganò, L., Zavatteri, M.: Security constraints in temporal role-based access-controlled workflows. In: CODASPY 2016. ACM (2016). https://doi.org/10.1145/2857705.2857716

  8. Dechter, R.: Constraint Processing. Elsevier, Amsterdam (2003)

    MATH  Google Scholar 

  9. Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artif. Int. 34(1), 1–38 (1987)

    Article  MathSciNet  Google Scholar 

  10. Eder, J., Franceschetti, M., Köpke, J.: Controllability of orchestrations with temporal SLA: encoding temporal XOR in CSTNUD. In: IIWAS 2018, pp. 234–242. ACM (2018). https://doi.org/10.1145/3282373.3282398

  11. Morris, P.H., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. IJCAI 2001, 494–502 (2001)

    Google Scholar 

  12. Posenato, R., Zerbato, F., Combi, C.: Managing decision tasks and events in time-aware business process models. In: Weske, M., Montali, M., Weber, I., vom Brocke, J. (eds.) BPM 2018. LNCS, vol. 11080, pp. 102–118. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98648-7_7

    Chapter  Google Scholar 

  13. Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. Computer 29(2), 38–47 (1996). https://doi.org/10.1109/2.485845

    Article  Google Scholar 

  14. Wang, Q., Li, N.: Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur. 13(4), 40 (2010)

    Article  Google Scholar 

  15. Zavatteri, M.: Conditional simple temporal networks with uncertainty and decisions. In: TIME 2017. vol. 90, pp. 23:1–23:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). https://doi.org/10.4230/LIPIcs.TIME.2017.23

  16. Zavatteri, M.: Temporal and resource controllability of workflows under uncertainty. In: Proceedings of the Dissertation Award, Demonstration, and Industrial Track at BPM 2019, vol. 2420, pp. 9–14. CEUR-WS.org (2019)

    Google Scholar 

  17. Zavatteri, M., Combi, C., Posenato, R., Viganò, L.: Weak, strong and dynamic controllability of access-controlled workflows under conditional uncertainty. In: Carmona, J., Engels, G., Kumar, A. (eds.) BPM 2017. LNCS, vol. 10445, pp. 235–251. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-65000-5_14

    Chapter  Google Scholar 

  18. Zavatteri, M., Combi, C., Rizzi, R., Viganò, L.: Hybrid sat-based consistency checking algorithms for simple temporal networks with decisions. In: TIME 2019. vol. 147, pp. 2:1–2:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019). https://doi.org/10.4230/LIPIcs.TIME.2019.2

  19. Zavatteri, M., Viganò, L.: Conditional simple temporal networks with uncertainty and decisions. Theoret. Comput. Sci. (2018). https://doi.org/10.1016/j.tcs.2018.09.023

  20. Zavatteri, M., Viganò, L.: Constraint networks under conditional uncertainty. In: ICAART 2018. pp. 41–52. SciTePress (2018). https://doi.org/10.5220/0006553400410052

  21. Zavatteri, M., Viganò, L.: Conditional uncertainty in constraint networks. In: van den Herik, J., Rocha, A.P. (eds.) ICAART 2018. LNCS (LNAI), vol. 11352, pp. 130–160. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05453-3_7

    Chapter  MATH  Google Scholar 

  22. Zavatteri, M., Viganò, L.: Last man standing: static, decremental and dynamic resiliency via controller synthesis. J. Comput. Secur. 27(3), 343–373 (2019). https://doi.org/10.3233/JCS-181244

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matteo Zavatteri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zavatteri, M., Combi, C., Viganò, L. (2019). Resource Controllability of Workflows Under Conditional Uncertainty. In: Di Francescomarino, C., Dijkman, R., Zdun, U. (eds) Business Process Management Workshops. BPM 2019. Lecture Notes in Business Information Processing, vol 362. Springer, Cham. https://doi.org/10.1007/978-3-030-37453-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37453-2_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37452-5

  • Online ISBN: 978-3-030-37453-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics