Skip to main content
SpringerLink
Log in

Evaluation of Technical Measures for Workflow Similarity Based on a Pilot Study

  • Conference paper
On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE (OTM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4275))

Abstract

Service discovery of state dependent services has to take workflow aspects into account. To increase the usability of a service discovery, the result list of services should be ordered with regard to the relevance of the services. Means of ordering a list of workflows due to their similarity with regard to a query are missing. In this paper different similarity measures are presented and evaluated based on a pilot of an empirical study. In particular the different measures are compared with the study results. It turns out that the quality of the different measures differ significantly.

An erratum to this chapter can be found at http://dx.doi.org/10.1007/11914853_71.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alves De Medeiros, A., Günther, C.: Process mining: Using CPN tools to create test logs for mining algorithms. In: Proceedings of the Sixth Workshop on the Practical Use of Coloured Petri Nets and CPN Tools (CPN) (2005)

    Google Scholar 

  2. Baeza-Yates, R.A.: Text retrieval: theory and practice. In: van Leeuwen, J. (ed.) Proceedings of the 12th IFIP World Computer Congress, Madrid, Spain, pp. 465–476. North-Holland, Amsterdam (1992)

    Google Scholar 

  3. Chartrand, G., Kubicki, G., Schultz, M.: Graph similarity and distance in graphs. Aequationes Mathematicae 55, 129–145 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. DeRemer, F., Kron, H.H.: Programming-in-the-large versus programming-in-the-small. IEEE Transactions on Software Engineering 2, 80–86 (1976)

    Article  MathSciNet  Google Scholar 

  5. Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled markov processes. Theoretical Computer Science, 318 (2004)

    Google Scholar 

  6. Du, Z., Huai, J., Liu, Y., Hu, C., Lei, L.: IPR: Automated interaction process reconciliation. In: Proceedings of IEEE/ACM International Conference on Web Intelligence (WI) (accepted for publication) (2005)

    Google Scholar 

  7. Folmer, E., Krukkert, D.: openXchange as ebXML implementation and validation; the first results. In: Proceeding of XML Europe 2003 Conference & Exposition (May 2003)

    Google Scholar 

  8. Fu, X., Bultan, T., Su, J.: Realizability of conversation protocols with message contents. In: Proceedings IEEE International Conference on Web Services (ICWS), pp. 96–103. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  9. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  10. Kindler, E., Martens, A., Reisig, W.: Inter-operability of workflow applications: Local criteria for global soundness. In: Business Process Management, Models, Techniques, and Empirical Studies, pp. 235–253. Springer, Heidelberg (2000)

    Google Scholar 

  11. Krukkert, D.: Matchmaking of ebXML business processes. Technical Report IST-28584-OX_D2.3_v.2.0, openXchange Project (October 2003)

    Google Scholar 

  12. Levenshtein, L.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics–Doklady 10(8), 707–710 (1966)

    MathSciNet  Google Scholar 

  13. Mahleko, B., Wombacher, A., Fankhauser, P.: A grammar-based index for matching business processes. In: Proceedings of IEEE International Conference on Web Services (ICWS), pp. 21–30. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  14. Mahleko, B., Wombacher, A., Fankhauser, P.: Process-annotated service discovery facilitated by an n-gram based index. In: Proceedings of IEEE International Confernce on e-Technology, e-Commerce and e-Service (EEE), pp. 2–8 (2005)

    Google Scholar 

  15. Mecella, M., Pernici, B., Craca, P.: Compatibility of e-Services in a Cooperative Multi-platform Environment. In: Casati, F., Georgakopoulos, D., Shan, M.-C. (eds.) TES 2001. LNCS, vol. 2193, pp. 44–57. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(5), 493–504 (1998)

    Article  Google Scholar 

  17. Mohri, M.: Edit-distance of weighted automata: General definitions and algorithms. International Journal of Foundations of Computer Science 14(6), 957–982 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Molina-Jimenez, C., Shrivastava, S., Solaiman, E., Warne, J.: Contract representation for run-time monitoring and enforcement. In: Proceedings of Conference on Electronic Commerce (CEC), pp. 103–110. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  19. RosettaNet. RosettaNet home page (2004), http://www.rosettanet.org

  20. Rozie, M., Wombacher, A.: Questionnaire of the empirical workflow similarity study (2005), http://www.cs.utwente.nl/~wombachera/papers/questionnaire_v1.0.zip

  21. Rozinat, A., van der Aalst, W.M.P.: Conformance testing: Measuring the fit and appropriateness of event logs and process models. In: Bussler, C.J., Haller, A. (eds.) BPM 2005. LNCS, vol. 3812, pp. 163–176. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Singh, M.P., Chopra, A.K., Desai, N., Mallya, A.U.: Protocols for processes: programming in the large for open systems. SIGPLAN Notices 39(12), 73–83 (2004)

    Article  Google Scholar 

  23. Tzschach, H., Hasslinger, G.: Codes fuer den stoerungssicheren Datentransfer. Oldenburg Verlag (1993)

    Google Scholar 

  24. van Breugel, F.: A behavioural pseudometric for metric labelled transition systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 141–155. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. van der Aalst, W.: Interorganizational workflows: An approach based on message sequence charts and petri nets. Systems Analysis - Modelling - Simulation 34(3), 335–367 (1999)

    MATH  Google Scholar 

  26. van der Aalst, W., Basten, T.: Inheritance of workflows: an approach to tackling problems related to change. Theor. Comput. Sci. 270(1-2), 125–203

    Google Scholar 

  27. van der Aalst, W., Hee, K.: Workflow Management - Models, Methods, and Systems. MIT Press, Cambridge (2002)

    Google Scholar 

  28. van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M.: Business process management: A survey. In: van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M. (eds.) BPM 2003. LNCS, vol. 2678, pp. 1–12. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  29. van Dongen, B.F., de Medeiros, A.K.A., Verbeek, H.M.W(E.), Weijters, A.J.M.M.T., van der Aalst, W.M.P.: The proM framework: A new era in process mining tool support. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 444–454. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Wombacher, A., Fankhauser, P., Mahleko, B., Neuhold, E.: Matchmaking for business processes based on choreographies. In: Proceedings of International Conference on e-Technology, e-Commerce and e-Service (EEE 2004). IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  31. Wombacher, A., Mahleko, B., Neuhold, E.: IPSI-PF:a business process matchmaking engine based on annotated finite state automata. Journal on Information Systems and E-Business Management 3(2), 127–150 (2005)

    Article  Google Scholar 

  32. Wombacher, A., Rozie, M.: Evaluation of workflow similarity measures in service discovery. In: Tagungsband der Multikonferenz Wirtschaftsinformatik - Service Oriented E-Commerce Track (MKWI). Lecture Notes in Informatics (LNI), vol. P-80, pp. 57–72. Gesellschaft fuer Informatik (2006)

    Google Scholar 

  33. Wombacher, A., Rozie, M.: Piloting an empirical study on meassures for workflow similarity. In: IEEE International Conference on Services Computing SCC (accepted) (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Twente, 7500 AE, Enschede, The Netherlands

    Andreas Wombacher

Authors
  1. Andreas Wombacher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. STARLab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium

    Robert Meersman

  2. School of Computer Science and Information Technology, RMIT University, Bld 10.10, 376-392 Swanston Street, 3001, Melbourne, VIC, Australia

    Zahir Tari

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wombacher, A. (2006). Evaluation of Technical Measures for Workflow Similarity Based on a Pilot Study. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. OTM 2006. Lecture Notes in Computer Science, vol 4275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11914853_16

Download citation

  • DOI: https://doi.org/10.1007/11914853_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48287-1

  • Online ISBN: 978-3-540-48289-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation