Abstract
We investigate to what extent existing algorithms for the discovery of component models from event logs can be leveraged to a system of asynchronously communicating components. Here, Enterprise nets model local processes, while Industry nets are compositions of Enterprise nets which interact through asynchronous message passing. We investigate the relation between the behaviour of an Industry net and that of its constituting Enterprise nets and we formalise the (causal) structure of global (Industry net) behaviour in terms of a partial order derived from the message passing. Next, we specify how (existing) algorithms for the discovery of isolated processes, can be adapted to enable the discovery of Enterprise nets, and we demonstrate how to combine these Enterprise nets into an Industry net. Using the results on the structure of the global behaviour, we relate the behaviour of the Industry net thus synthesised to the behaviour of the Enterprise nets and show how fitness of the Enterprise nets (the event log provided as input is included in the behaviour of the discovered net) is preserved as fitness of the Industry net. Moreover, we discuss possible underfitting of the global model (the model exhibits more behaviour than observed in the event log) and show how it can be explained in terms of concurrency between the component models and a completeness property of the event log.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We thus view T as an alphabet.
- 2.
The elements of the alphabet T are symbols consisting of two letters. We denote in this and similar examples, any sequence \(a_1 \cdots a_n\) with \(a_i \in T\) for each \(i \in [n]\) by \(\langle a_1, \cdots , a_n \rangle \).
- 3.
In case \(\mathcal {A}\) is an algorithm for the discovery of workflow nets, like the Inductive Miner [22], \(\mathcal {A}_{E}(L,\mathcal {D\!A})\) would have the structure of a workflow net.
- 4.
In March 2021 this volume was in the order of 21 Mln. FIN messages per day. Source: https://www.swift.com/about-us/swift-fin-traffic-figures.
References
van der Aalst, W.M.P., Mooij, A.J., Stahl, C., Wolf, K.: Service interaction: patterns, formalization, and analysis. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 42–88. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01918-0_2
Aalst, W.M.P.: Distributed process discovery and conformance checking. In: de Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 1–25. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28872-2_1
van der Aalst, W.M.P., Weske, M.: Reflections on a decade of interorganizational workflow research. In: Seminal Contributions to Information Systems Engineering, pp. 307–313. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36926-1_24
van der Aalst, W.M.P.: Decomposing petri nets for process mining: a generic approach. Distr. Parallel Databases 31(4), 471–507 (2013)
van der Aalst, W.M.P.: Service mining: using process mining to discover, check, and improve service behavior. IEEE Trans. Serv. Comput. 6(4), 525–535 (2013)
van der Aalst, W.M.P.: Process Mining - Data Science in Action, 2nd edn. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-662-49851-4
van der Aalst, W.M.P., Stahl, C.: Modeling Business Processes - A Petri Net-Oriented Approach. MIT Press, Cambridge (2011)
Augusto, A., et al.: Automated discovery of process models from event logs: review and benchmark. IEEE Trans. Knowl. Data Eng. 31(4), 686–705 (2019)
Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional modeling of reactive systems using open nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 502–518. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44685-0_34
Bernardinello, L., Lomazova, I.A., Nesterov, R., Pomello, L.: Compositional discovery of workflow nets from event logs using morphisms. In: ATAED 2018. CEUR Workshop Proceedings, vol. 2115, pp. 39–55 (2018)
Biermann, I., Rozoy, B.: Reliable generalized and context dependent commutation relations. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997. LNCS, vol. 1214, pp. 165–176. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0030594
Carmona, J., van Dongen, B.F., Solti, A., Weidlich, M.: Conformance Checking - Relating Processes and Models. Springer, Switzerland (2018). https://doi.org/10.1007/978-3-319-99414-7
EDSN: Marktfacilitering. [In Dutch] (2018).https://www.edsn.nl/
Gomes, L., Paulo Barros, J.: Structuring and composability issues in petri nets modeling. IEEE Trans. Indus. Inform. 1(2), 112–123 (2005)
Haddad, S., Hennicker, R., Møller, M.H.: Channel properties of asynchronously composed petri nets. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 369–388. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38697-8_20
Heckel, R.: Open petri nets as semantic model for workflow integration. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 281–294. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40022-6_14
Hoogeboom, H.J., Rozenberg, G.: Dependence graphs. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 43–67. World Scientific, Singapore (1995)
HL7: Health Level Seven International (2015). http://www.hl7.org/
Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A trace semantics for petri nets. Inf. Comput. 117(1), 98–114 (1995)
Kwantes, P.M., Kleijn, J.: On discovering distributed process models - the case of asynchronous communication. In: ATAED 2020. CEUR Workshop Proceedings, vol. 2625, pp. 49–65 (2020)
Kwantes, P.M., Kleijn, J.: On the synthesis of industry level process models from enterprise level process models. In: ATAED 2018 CEUR Workshop Proceedings, vol. 2115, pp. 6–22 (2018)
Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from event logs - a constructive approach. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 311–329. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38697-8_17
Massuthe, P., Reisig, W., Schmidt, K.: An Operating Guideline Approach to the SOA. Humboldt-Universitat zu Berlin, Mathematisch-Naturwissenschaftliche Fakultat II, Institut fur Informatik (2005)
S.W.I.F.T: ISO20022 Universal financial industry message scheme (2015). http://www.iso20022.org
Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278–324. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-17906-2_30
Reisig, W.: Towards a conceptual foundation of service composition. Comput. Sci. Res. Dev. 33(3–4), 281–289 (2018)
Reisig, W.: Associative composition of components with double-sided interfaces. Acta Inf. 56(3), 229–253 (2019)
GS1US: RosettaNet (2018). http://www.rosettanet.org/
Wolf, K.: Does my service have partners? Trans. Petri Nets Other Model. Concurr. 2, 152–171 (2009)
Zaitsev, D., Sleptsov, A.: State equations and equivalent transformations for timed petri nets. Cybern. Syst. Anal. 33, 659–672 (1997)
Zaitsev, D.: Decomposition of petri nets. Cybern. Syst. Anal. 4, 131–140 (2004)
Acknowledgement
The authors are grateful to the anonymous reviewers for their constructive suggestions which have led to an improvement of the presentation of the results of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Kwantes, P., Kleijn, J. (2022). Distributed Synthesis of Asynchronously Communicating Distributed Process Models. In: Koutny, M., Kordon, F., Moldt, D. (eds) Transactions on Petri Nets and Other Models of Concurrency XVI. Lecture Notes in Computer Science(), vol 13220. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-65303-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-65303-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-65302-9
Online ISBN: 978-3-662-65303-6
eBook Packages: Computer ScienceComputer Science (R0)