Abstract
We provide a formal semantics for timed DCR graphs with decision events and data, and show how the model supports merging declarative decision modelling and process modelling in one notation. We exemplify the model by an expense report process and discuss how decisions may be presented using DMN jointly with the DCR process notation. If data domains are bounded, models are finite state and allow formal verification of both safety and liveness properties. The formal model is fully implemented in commercial process design and workflow management systems provided by DCR Solutions and also freely available for academic use.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
A time step is a discrete duration of time orthogonal to the execution of events. A time step can represent any duration, examples being a computers clock cycle, a day or a year. For the examples in this paper a time step is a day.
References
Back, C.O., Slaats, T., Hildebrandt, T., Marquard, M.: Discover: accurate & efficient discovery of declarative process models. arXiv, abs/2005.10085 (2020)
Bazhenova, E., Zerbato, F., Oliboni, B., Weske, M.: From BPMN process models to DMN decision models. Inf. Syst. 83, 69–88 (2019)
Debois, S., Hildebrandt, T.: The DCR workbench: declarative choreographies for collaborative processes. In: Gay, S., Ravara, A. (eds.) Behavioural Types: From Theory to Tools, pp. 99–124. River Publishers, June 2017
Debois, S., Slaats, T.: The analysis of a real life declarative process. In: SSCI 2015, pp. 1374–1382. IEEE (2015)
Debois, S., Hildebrandt, T.T., Slaats, T.: Replication, refinement & reachability: complexity in dynamic condition-response graphs. Acta Informatica 55(6), 489–520 (2017). https://doi.org/10.1007/s00236-017-0303-8
Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Property specification patterns for finite-state verification. In: Proceedings of the Second Workshop on Formal Methods in Software Practice, pp. 7–15 (1998)
Goedertier, S., Vanthienen, J., Caron, F.: Declarative business process modelling: principles and modelling languages. Enterp. Inf. Syst. 9, 161–185 (2013)
Object Management Group. Business Process Model and Notation V 2.0.2 (2014)
Object Management Group: Decision Model and Notation V 1.3 (2020)
Hildebrandt, T., Mukkamala, R.R., Slaats, T.: Nested dynamic condition response graphs. In: Arbab, F., Sirjani, M. (eds.) FSEN 2011. LNCS, vol. 7141, pp. 343–350. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29320-7_23
Hildebrandt, T.T., Mukkamala, R.R.: Declarative event-based workflow as distributed dynamic condition response graphs. In: Honda, K., Mycroft, A. (eds.) Proceedings of the Third Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software, PLACES 2010, Paphos, Cyprus, 21st March 2010. EPTCS, vol. 69, pp. 59–73 (2010)
Hildebrandt, T.T., Mukkamala, R.R., Slaats, T., Zanitti, F.: Contracts for cross-organizational workflows as timed dynamic condition response graphs. J. Log. Algebr. Program. 82(5–7), 164–185 (2013)
Marquard, M., Debois, S., Slaats, T., Hildebrandt, T.T.: Forms are declarative processes! In: BPM 2016 Industry Track (2016, to appear)
Marquard, M., Shahzad, M., Slaats, T.: Web-based modelling and collaborative simulation of declarative processes. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 209–225. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23063-4_15
Mertens, S., Gailly, F., Poels, G.: Enhancing declarative process models with DMN decision logic. In: Gaaloul, K., Schmidt, R., Nurcan, S., Guerreiro, S., Ma, Q. (eds.) CAISE 2015. LNBIP, vol. 214, pp. 151–165. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19237-6_10
Montali, M., Chesani, F., Mello, P., Maggi, F.M.: Towards data-aware constraints in declare. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC 2013, pp. 1391–1396. Association for Computing Machinery, New York (2013)
Mukkamala, R.R.: A formal model for declarative workflows: dynamic condition response graphs. Ph.D. thesis, IT University of Copenhagen, June 2012
Normann, H., Debois, S., Slaats, T., Hildebrandt, T.T.: Zoom and enhance: action refinement via subprocesses in timed declarative processes. In: Polyvyanyy, A., Wynn, M.T., Van Looy, A., Reichert, M. (eds.) BPM 2021. LNCS, vol. 12875, pp. 161–178. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85469-0_12
Pesic, M., Schonenberg, H., Aalst, W.: Declare: full support for loosely-structured processes. In: Proceedings - IEEE International Enterprise Distributed Object Computing Workshop, EDOC, pp. 287–287, November 2007
Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science (SFCS 1977), pp. 46–57 (1977)
Seco, J.C., Debois, S., Hildebrandt, T.T., Slaats, T.: RESEDA: declaring live event-driven computations as REactive SEmi-Structured DAta. In: 22nd IEEE International Enterprise Distributed Object Computing Conference, EDOC 2018, pp. 75–84 (2018)
Slaats, T.: Flexible process notations for cross-organizational case management systems. Ph.D. thesis, IT University of Copenhagen, January 2015
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Hildebrandt, T.T., Normann, H., Marquard, M., Debois, S., Slaats, T. (2022). Decision Modelling in Timed Dynamic Condition Response Graphs with Data. In: Marrella, A., Weber, B. (eds) Business Process Management Workshops. BPM 2021. Lecture Notes in Business Information Processing, vol 436. Springer, Cham. https://doi.org/10.1007/978-3-030-94343-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-94343-1_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-94342-4
Online ISBN: 978-3-030-94343-1
eBook Packages: Computer ScienceComputer Science (R0)