The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Similarity of business process models: Metrics and evaluation
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
WordNet: a lexical database for English
Miller, G. A. (1995) · Communications of the ACM · doi:10.1145/219717.219748 · Cited by 14,015
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
A vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521
A survey of approaches to automatic schema matching
Rahm, E., & Bernstein, P. A. (2001) · The VLDB Journal · doi:10.1007/s007780100057 · Cited by 3,352
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
van der Aalst, W. M. P., ter Hofstede, A. H. M., Kiepuszewski, B., & Barros, A. P. (2003) · Distributed and Parallel Databases · doi:10.1023/a:1022883727209 · Cited by 2,613
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Similarity flooding: a versatile graph matching algorithm and its application to schema matching
Melnik, S., Garcia-Molina, H., & Rahm, E. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994702 · Cited by 1,341
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Jonker, R., & Volgenant, A. (1987) · Computing · doi:10.1007/bf02278710 · Cited by 1,230
Business process mining: An industrial application
van der Aalst, W. M. P., Reijers, H. A., Weijters, A. J. M. M., et al. (2006) · Information Systems · doi:10.1016/j.is.2006.05.003 · Cited by 788
A graph distance metric based on the maximal common subgraph
Bunke, H., & Shearer, K. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00179-7 · Cited by 754
Semantics and analysis of business process models in BPMN
Dijkman, R., Dumas, M., & Ouyang, C. (2008) · Information and Software Technology · doi:10.1016/j.infsof.2008.02.006 · Cited by 734
Self-citationWeber, B., Reichert, M., & Rinderle‐Ma, S. (2008) · Data & Knowledge Engineering · doi:10.1016/j.datak.2008.05.001 · Cited by 574
Evaluating Evaluation Measure Stability
Buckley, C., & Voorhees, E. M. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130373 · Cited by 559
Combining the language model and inference network approaches to retrieval
Metzler, D., & Croft, W. B. (2004) · Information Processing & Management · doi:10.1016/j.ipm.2004.05.001 · Cited by 274
Decidability and complexity of Petri net problems — An introduction
Esparza, J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-65306-6_20 · Cited by 263
International Conference on Data Engineering
(1985) · Computer · doi:10.1109/mc.1985.1662748 · Cited by 258
Measuring Similarity between Business Process Models
van Dongen, B., Dijkman, R., & Mendling, J. (2008) · Notes on Numerical Fluid Mechanics and Multidisciplinary Design · doi:10.1007/978-3-540-69534-9_34 · Cited by 248
Self-citationAn efficient algorithm for branching bisimulation and stuttering equivalence
Groote, J. F., & Vaandrager, F. (2005) · Springer eBooks · doi:10.1007/bfb0032063 · Cited by 178
Toward high-precision service retrieval
Klein, M., & Bernstein, A. (2004) · IEEE Internet Computing · doi:10.1109/mic.2004.1260701 · Cited by 170
A case-based reasoning framework for workflow model management
Madhusudan, T., Zhao, J. L., & Marshall, B. B. (2004) · Data & Knowledge Engineering · doi:10.1016/j.datak.2004.01.005 · Cited by 157
Mining and reasoning on workflows
Greco, G., Guzzo, A., Manco, G., & Saccà, D. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.63 · Cited by 59
Behavioral matchmaking for service retrieval: Application to conversation protocols
Grigori, D., Corrales, J. C., & Bouzeghoub, M. (2008) · Information Systems · doi:10.1016/j.is.2008.02.004 · Cited by 48
Cited by
Business Process Management: A Comprehensive Survey
van der Aalst, W. M. P. (2013) · ISRN Software Engineering · doi:10.1155/2013/507984 · Cited by 828
Digital transformation and the new logics of business process management
Baiyere, A., Salmela, H., & Tapanainen, T. (2020) · European Journal of Information Systems · doi:10.1080/0960085x.2020.1718007 · Cited by 534
Enabling Flexibility in Process-Aware Information Systems
Reichert, M., & Weber, B. (2012) · Springer eBooks · doi:10.1007/978-3-642-30409-5 · Cited by 414
Process mining techniques and applications – A systematic mapping study
Garcia, C. D. S., Meincheim, A., Faria Junior, E. R., Dallagassa, M. R., Sato, D. M. V., Carvalho, D. R., Santos, E. A. P., & Scalabrin, E. E. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.05.003 · Cited by 334
Metadata
- Authors
- Dijkman, R., Dumas, M., van Dongen, B., Käärik, R., & Mendling, J.
- Venue
- Information Systems
- Publisher
- Elsevier BV
- Published
- 2011-04
- Volume
- 36
- Issue
- 2
- Pages
- 498-516
- ISSN
- 0306-4379 (ISSN-L)
- OpenAlex
- W2042759024
- Cited by
- 611
- References
- 25
- FWCI
- 100.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.