Evaluation of workflow similarity measures in service discovery

Lecture Notes in Geoinformation and Cartography

Volumn , Issue , 2006, Pages 57-72

  Wombacher, Andreas ^a   Rozie, Maarten ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY RESULTS; SERVICE DISCOVERY; SIMILARITY MEASURE; STATE-DEPENDENT;

EID: 84880006729     PISSN: 18632351     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. W.M.P. van der Aalst. Interorganizational Workflows: An Approach based on Message Sequence Charts and Petri Nets. Systems Analysis - Modelling - Simulation, 34(3):335-367, 1999.
2. W.M.P. van der Aalst and Kees van Hee. Workflow Management - Models, Methods, and Systems. MIT Press, 2002.
3. Abraham Bernstein and Mark Klein. Discovering Services: Towards High- Precision Service Retrieval. In Proceedings of CAiSE International Workshop, Web Services, E-Business, and the Semantic Web (WES), LNCS 2512, pages 260-275. Springer, 2002.
4. A. Soydan Bilgin and Munindar P. Singh. A DAML-based Repository for QoSAware Semantic Web Service Selection. In Proceedings of IEEE International Conference on Web Services, pages 368-375, 2004.
5. R. A. Baeza-Yates. Text retrieval: theory and practice. In J. van Leeuwen, editor, Proceedings of the 12th IFIP World Computer Congress, pages 465-476, Madrid, Spain, 1992. North-Holland.
6. Gary Chartrand, Grzegorz Kubicki, and Michelle Schultz. Graph Similarity and Distance in Graphs. Aequationes Mathematicae, 55:129-145, 1998.
7. OWL Service Coalition. OWL-S: Semantic Markup for Web Services. http://www.daml.org/services/owl-s/1.0/owl-s.pdf, 2004.
8. Zongxia Du, Jinpeng Huai, Yunhao Liu, Chunming Hu, and Lei Lei. IPR: Automated Interaction Process Reconciliation. In Proceedings of IEEE/ACM International Conference on Web Intelligence (WI), 2005. accepted for publication.
9. D. Harel. Statecharts: A Visual Formalism For Complex Systems. Science of Computer Programming, 8(3):231-274, June 1987.
10. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2001.
11. Mark Klein and Abraham Bernstein. Searching for Services on the Semantic Web using Process Ontologies. In Proceedings of 1st Semantic Web Working Symposium (SWWS), Stanford, 2001.
12. Ekkart Kindler, Axel Martens, and Wolfgang Reisig. Inter-operability of Workflow Applications: Local Criteria for Global Soundness. In Business Process Management, Models, Techniques, and Empirical Studies, pages 235-253. Springer-Verlag, 2000.
13. L. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals, . Soviet Physics-Doklady, 10(8):707-710, 1966.
14. Y. Liu, A. H. H. Ngu, and L. Zeng. QoS Computation and Policing in Dynamic Web Service Selection. In Proceedings of WWW, page 66ff, 2004.
15. Bruno T. Messmer and Horst Bunke. A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(5):493-504, 1998.
16. Mehryar Mohri. Edit-Distance of Weighted Automata. In Jean-Marc Champarnaud and Denis Maurel, editors, Proceedings of International Conference on Implementation and Application of Automata (CIAA), volume 2608 of Lecture Notes in Computer Science, pages 1-23. Springer, 2003.
17. Mehryar Mohri. Edit-Distance of Weighted Automata: General Definitions and Algorithms. International Journal of Foundations of Computer Science, 14(6):957-982, 2003.
18. Bendick Mahleko, Andreas Wombacher, and Peter Fankhauser. 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), pages 2-8, 2005.
19. James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, 1981.
20. Hans Tzschach and Gerhard Hasslinger. Codes fuer den stoerungssicheren Datentransfer. Oldenburg Verlag, 1993.
21. W. M. P. van der Aalst and T. Basten. Inheritance of workflows: an approach to tackling problems related to change. Theor. Comput. Sci., 270(1-2):125-203, uary.
22. Andreas Wombacher, Peter Fankhauser, Bendick Mahleko, and Erich Neuhold:. Matchmaking for Business Processes Based on Choreographies. Intl. Journal of Web Services, 1(4):14-32, 2004.
23. A. Wombacher, P. Fankhauser, and E. Neuhold. Transforming BPEL into annotated Deterministic Finite State Automata enabling process annotated service discovery. In Proceedings of International Conference on Web Services (ICWS), pages 316-323, 2004.
24. Andreas Wombacher, Bendick Mahleko, and Erich Neuhold. IPSI-PF: A Business Process Matchmaking Engine. In Proceedings of Conference on Electronic Commerce (CEC), pages 137-145, 2004.
25. Andreas Wombacher, Bendick Mahleko, and Erich Neuhold. 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.