Evaluation of Technical Measures for Workflow Similarity Based on a Pilot Study
Lecture notes in computer sciencePublished 1 January 2006
Andreas Wombacher
Citations48
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Different similarity measures are presented and evaluated based on a pilot of an empirical study and it turns out that the quality of the different measures differ significantly.
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.
Keywords
Computer ScienceBusiness, Management and Accounting
Mathematics and Computers in SimulationIntroduction to automata theory, languages and computation
10,827 Citations1981
Lecture notes in computer scienceBusiness Process Management: A Survey
1,324 Citations2003Wil M. P. van der Aalst, Arthur H. M. ter Hofstede +1 more
The acronyms in this domain are tried to demystify, the state-of-the-art technology is described, and it is argued that BPM could benefit from formal methods/languages.
Lecture notes in computer scienceThe ProM Framework: A New Era in Process Mining Tool Support
919 Citations2005Boudewijn F. van Dongen, Ana Karla Alves de Medeiros +3 more
The ProM framework is introduced and an overview of the plug-ins that have been developed and is flexible with respect to the input and output format, and is also open enough to allow for the easy reuse of code during the implementation of new process mining ideas.
RePEc: Research Papers in EconomicsWorkflow Management: Models, Methods, and Systems
743 Citations2004Wil M. P. van der Aalst, Kees vanHee
ACM SIGPLAN NoticesProgramming-in-the large versus programming-in-the-small
582 Citations1975Frank DeRemer, Hans H. Kron
Theoretical Computer ScienceInheritance of workflows: an approach to tackling problems related to change
492 Citations2002Wil M. P. van der Aalst, Twan Basten
In this paper, inheritance-preserving transformation rules for workflow processes are proposed and it is shown that these rules can be used to avoid problems such as the "dynamic-change bug."
IEEE Transactions on Pattern Analysis and Machine IntelligenceA new algorithm for error-tolerant subgraph isomorphism detection
335 Citations1998Bettina Messmer, Horst Bunke
A new algorithm for error-correcting subgraph isomorphism detection from a set of model graphs to an unknown input graph is proposed based on a compact representation of the model graphs that can be combined with a future cost estimation method that greatly improves its run-time performance.
Theoretical Computer ScienceMetrics for labelled Markov processes
309 Citations2003Josée Desharnais, Vineet Gupta +2 more
A metric is studied between labelled Markov processes that has the property that processes are at zero distance if and only if they are bisimilar and is related, in spirit, to the Hutchinson metric.
IEEE Transactions on Software EngineeringProgramming-in-the-Large Versus Programming-in-the-Small
306 Citations1976Frank DeRemer, Hans H. Kron
Lecture notes in computer scienceTransactions in RCCS
299 Citations2005Vincent Danos, Jean Krivine
A formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtrack mechanism is proposed.
Interorganizational workflows: An approach based on message sequence charts and petri nets
232 Citations1999Wil M. P. van der Aalst
This paper uses message sequence charts to specify the interaction between organizations and Petri nets are used to model the workflows inside each organization.
Lecture notes in computer scienceApplications and Theory of Petri Nets 2005
198 Citations2005Gianfranco Ciardo, Philippe Darondeau +1 more
Particle Petri Nets for Aircraft Procedure Monitoring Under Uncertainty, and the Expressive Power of Petri Net Schemata.
Lecture notes in computer scienceConformance Testing: Measuring the Fit and Appropriateness of Event Logs and Process Models
162 Citations2006A. Rozinat, Wil M. P. van der Aalst
Two dimensions of conformance are distinguished: fitness (the event log may be the result of the process modeled) and appropriateness (the model is a likely candidate from a structural and behavioral point of view).
Lecture notes in computer scienceTechnologies for E-Services
127 Citations2003Baresi L., Fugini M. G. +4 more
Matchmaking for business processes based on choreographies
112 Citations2004Andreas Wombacher, Péter Fankhauser +2 more
This work gives a formal semantics to business process matchmaking based on finite state automata extended by logical expressions associated to states that will enable companies and organizations to be able to establish ad-hoc business relations without relying on manually negotiated interorganizational workflows.
Lecture notes in computer scienceInter-operability of Workflow Applications: Local Criteria for Global Soundness
104 Citations2000Ekkart Kindler, Axel Martens +1 more
A technique is proposed which allows to detect but a few errors of workflow applications which arise from incorrect inter-operation of workflows and which can be checked for local soundness with respect to this specification.
International Journal of Foundations of Computer ScienceEDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
102 Citations2003Mehryar Mohri
The edit-distance of two distributions over strings is defined and algorithms for computing it when these distributions are given by automata are presented, including the general algorithm of composition of weighted transducers combined with a single-source shortest-paths algorithm.
Process mining: Using CPN tools to create test logs for mining algorithms
77 Citations2005Ana Karla Alves de Medeiros, Christian Günther
CP-nets are extended to generate XML event logs that can be mined by process mining tools supporting this format and benefit from the simulation capabilities of CPN Tools and, therefore, avoid reinventing the wheel.
Lecture notes in computer scienceCompatibility of e-Services in a Cooperative Multi-platfrom Environment
74 Citations2001Massimo Mecella, Barbara Pernici +1 more
A run-time architecture supporting the execution of e- services in a multti-platform environment is dicussed, based on a repository storing all e-Services and process specifiication.
Aequationes MathematicaeGraph similarity and distance in graphs
74 Citations1998Gary Chartrand, Grzegorz Kubicki +1 more
It is shown that every distance graph is bipartite and, moreover, that all even cycles and all forests are distance graphs.
Text-Retrieval: Theory and Practice
57 Citations1992Ricardo Baeza‐Yates
The state of the art of the main component of text retrieval systems: the searching engine is presented and the gap between theoretical vs. practical algorithms is explored.
Contract representation for run-time monitoring and enforcement
52 Citations2003Carlos Molina-Jiménez, Santosh Shrivastava +2 more
This work discusses how standard conventional contracts can be described by means of finite state machines (FSMs), and describes how to map the rights and obligations extracted from the clauses of the contract into the states, transition and output functions, and input and output symbols of a FSM.
Lecture notes in computer scienceA Behavioural Pseudometric for Metric Labelled Transition Systems
40 Citations2005Franck van Breugel
In this paper a behavioural pseudometric is introduced for metric labelled transition systems, which generalise the fixed point, logical and coinductive characterisations of bisimilarity.
Realizability of conversation protocols with message contents
39 Citations2004Xiang Fu, Tevfik Bultan +1 more
Evaluation of Workflow Similarity Measures in Service Discovery.
35 Citations2006Andreas Wombacher, Maarten Rozie
ACM SIGPLAN NoticesProtocols for processes
33 Citations2004Munindar P. Singh, Amit K. Chopra +2 more
This paper describes some elements of a conceptual model of processes that will incorporate abstractions based on protocols, roles, and commitments and methodologies involving rule-based reasoning to specify processes in terms of compositions of protocols.
Data Archiving and Networked Services (DANS)Evolution of workflow similarity measures in service discovery
25 Citations2006Andreas Wombacher, Maarten Rozie
Information Systems and e-Business ManagementIPSI-PF.A business process matchmaking engine based on annotated finite state automata
22 Citations2005Andreas Wombacher, Bendick Mahleko +1 more
The IPSI Process Finder (IPSI-PF) realizes service discovery by extending the capabilities of UDDI by matchmaking of service descriptions, and the extension is realized such that an integration of additional extensions can be added quite easily.
A grammar-based index for matching business processes
21 Citations2005Bendick Mahleko, Andreas Wombacher +1 more
This paper presents an approach for indexing and matching complex services using an abstraction that transforms the underlying FSA via its grammar into a form that can be indexed using available index mechanisms.
Process-annotated service discovery facilitated by an n-gram-based index
12 Citations2005Bendick Mahleko, Andreas Wombacher +1 more
Experimental studies on a collection of over 800 abstract business processes derived from the RosettaNet PIP specification show that the paper's approach outperforms naive sequential scanning by up to an order of magnitude.
Piloting an Empirical Study on Measures forWorkflow Similarity
11 Citations2006Andreas Wombacher, Maarten Rozie
It turns out that, although preliminary, relations between different measures are indicated and that a similarity definition depends on the application scenario in which the service discovery is applied.
IPR: Automated Interaction Process Reconciliation
7 Citations2005Zongxia Du, Jinpeng Huai +3 more
A practical automated reconciliation algorithm, called IPR (interaction process reconciliation) based on Petri net, which is able to effectively facilitate dynamic interactions among trading partners in a peer-to-peer fashion and significantly outperforms existing approaches in terms of matching success rate, response time, and matching efficiency.