Behavioral comparison of process models based on canonically reduced event structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8659 LNCS, Issue , 2014, Pages 267-282

  Armas Cervantes, Abel ^a   Baldan, Paolo ^b   Dumas, Marlon ^a   García Bañuelos, Luciano ^a  

^a UNIVERSITY OF TARTU   (Estonia)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BUSINESS PROCESS MODEL; CAUSAL RELATIONS; EVENT STRUCTURES; PROCESS MODEL;

ENTERPRISE RESOURCE MANAGEMENT;

EID: 84906736749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-10172-9_17     Document Type: Conference Paper

References (23)

1. Dijkman, R., Dumas, M., van Dongen, B., Käärik, R., Mendling, J.: Similarity of business process models: Metrics and evaluation. Inf. Sys. 36(2), 498-516 (2011)
2. La Rosa, M., Clemens, S., ter Hofstede, A.H.M., Russell, N.: Appendix A. The Order Fulfillment Process Model. In: Modern Business Process Automation 2010 (2010)
3. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri Nets, Event Structures and Domains, Part I. Theoretical Computer Science 13, 85-108 (1981)
4. Baldan, P., Corradini, A., Montanari, U.: Contextual Petri Nets, Asymmetric Event Structures, and Processes. Information and Computation 171, 1-49 (2001)
5. Armas, A., Baldan, P., García-Bañuelos, L.: Reduction of event structures under hp-bisimulation. Technical report, http://arxiv.org/abs/ 1403.7181
6. Polyvyany, A., García-Bañuelos, L., Dumas, M.: Structuring acyclic process models. Information Systems 37(6), 518-538 (2012)
7. van Glabbeek, R., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, 229-327 (2001)
8. Cleaveland, R.: On automatically explaining bisimulation inequivalence. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 364-372. Springer, Heidelberg (1991)
9. Sokolsky, O., Kannan, S., Lee, I.: Simulation-Based Graph Similarity. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 426-440. Springer, Heidelberg (2006)
10. Dijkman, R.: Diagnosing Differences between Business Process Models. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 261-277. Springer, Heidelberg (2008)
11. Weidlich, M., Mendling, J., Weske, M.: Efficient Consistency Measurement Based on Behavioral Profiles of Process Models. IEEE TSE 37(3), 410-429 (2011)
12. Weidlich, M., Polyvyanyy, A., Mendling, J., Weske, M.: Causal Behavioural Profiles. Fundamenta Informaticae 113(3-4), 399-435 (2011)
13. van der Aalst, W.M.P., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE TKDE 16(9), 1128-1142 (2004)
14. Badouel, E.: On the α-Reconstructibility of Workflow Nets. In: Haddad, S., Pomello, L. (eds.) PETRI NETS 2012. LNCS, vol. 7347, pp. 128-147. Springer, Heidelberg (2012)
15. Weidlich, M., van derWerf, J.M.: On Profiles and Footprints - Relational Semantics for Petri Nets. In: Haddad, S., Pomello, L. (eds.) PETRI NETS 2012. LNCS, vol. 7347, pp. 148-167. Springer, Heidelberg (2012)
16. Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28, 575-591 (1991)
17. van Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions.. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379, pp. 237-248. Springer, Heidelberg (1989)
18. Armas, A., Baldan, P., Dumas, M., García-Bañuelos, L.: Behavioral comparison of process models based on canonically reduced event structures. Technical report It is, available at, http://math.ut.ee/~abela
19. McKay, B.D.: Practical graph isomorphism. Department of Computer Science, Vanderbilt University (1981)
20. Kant, G.: Using canonical forms for isomorphism reduction in graph-based model checking. Technical report, CTIT University of Twente, Enschede (July 2010)
21. McMillan, K.L., Probst, D.K.: A Technique of State Space Search Based on Unfolding. Formal Methods in System Design 6(1), 45-65 (1995)
22. Esparza, J., Römer, S., Vogler, W.: An Improvement of McMillan's Unfolding Algorithm. Formal Methods in System Design 30(2), 285-310 (2002)
23. Khomenko, W.V., Koutny, M., Vogler: Canonical prefixes of Petri net unfoldings. Acta Informatica 40(2), 95-118 (2003)