The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Discovering models of software processes from event-based data
Open accessAbstract
Many software process methods and tools presuppose the existence of a formal model of a process. Unfortunately, developing a formal model for an on-going, complex process can be difficult, costly, and error prone. This presents a practical barrier to the adoption of process technologies, which would be lowered by automated assistance in creating formal models. To this end, we have developed a data analysis technique that we term process discovery. Under this technique, data describing process events are first captured from an on-going process and then used to generate a formal model of the behavior of that process. In this article we describe a Markov method that we developed specifically for process discovery, as well as describe two additional methods that we adopted from other domains and augmented for our purposes. The three methods range from the purely algorithmic to the purely statistical. We compare the methods and discuss their application in an industrial case study.
Overview
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Language identification in the limit
Gold, E. M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91165-5 · Cited by 3,572 · cited 2×
“2 Previous Complexity Results Gold’s “identification in the limit” was the first framework for analyzing the grammar inference problem [34].”
BackgroundMethodInfluentialValiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279 · cited 2×
“The PAC model for learning concepts from examples was proposed by Valiant [54].”
MethodLearning regular sets from queries and counterexamples
Angluin, D. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90052-6 · Cited by 2,114
Reverse engineering and design recovery: a taxonomy
Chikofsky, E. J., & Cross, J. H. (1990) · IEEE Software · doi:10.1109/52.43044 · Cited by 2,012
The KDD process for extracting useful knowledge from volumes of data
Fayyad, U., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Communications of the ACM · doi:10.1145/240455.240464 · Cited by 1,934 · cited 2×
“In this framework, the various data-mining methods provide just a single step in the whole process of information discovery [Fayyad et al. 1996].”
MethodInductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
Complexity of automaton identification from given data
Gold, E. M. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90562-4 · Cited by 771
Inductive inference of formal languages from positive data
Angluin, D. (1980) · Information and Control · doi:10.1016/s0019-9958(80)90285-5 · Cited by 745
Data mining and knowledge discovery in databases
Fayyad, U., & Uthurusamy, R. (1996) · Communications of the ACM · doi:10.1145/240455.240463 · Cited by 590
Inference of Reversible Languages
Angluin, D. (1982) · Journal of the ACM · doi:10.1145/322326.322334 · Cited by 526
On the Synthesis of Finite-State Machines from Samples of Their Behavior
Biermann, A. W., & Feldman, J. A. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5009015 · Cited by 510
Proceedings of the 44th International Conference on Software Engineering
(2022) · doi:10.1145/3510003 · Cited by 326
Approaches to the Automatic Discovery of Patterns in Biosequences
BRAZMA, A., JONASSEN, I., EIDHAMMER, I., & GILBERT, D. (1998) · Journal of Computational Biology · doi:10.1089/cmb.1998.5.279 · Cited by 303
Proceedings of 1993 15th International Conference on Software Engineering
(1993) · Proceedings of 1993 15th International Conference on Software Engineering · doi:10.1109/icse.1993.346061 · Cited by 240
Inductive inference, DFAs, and computational complexity
Pitt, L. (1989) · Lecture Notes in Computer Science · doi:10.1007/3-540-51734-0_50 · Cited by 223
Automating process discovery through event-data analysis
Cook, J. E., & Wolf, A. L. (1995) · Proceedings of the 17th international conference on Software engineering - ICSE '95 · doi:10.1145/225014.225021 · Cited by 212
Self-citationEfficient learning of context-free grammars from positive structural examples
Sakakibara, Y. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90003-x · Cited by 180
Learning Finite State Machines With Self-Clustering Recurrent Networks
Zeng, Z., Goodman, R. M., & Smyth, P. (1993) · Neural Computation · doi:10.1162/neco.1993.5.6.976 · Cited by 167
Carrasco, R. C., & Oncina, J. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58473-0 · Cited by 120
A study in software process data capture and analysis
Wolf, A. L., & Rosenblum, D. S. (2002) · doi:10.1109/spcon.1993.236817 · Cited by 78
Self-citationProceedings of the 17th international conference on Software engineering
Perry, D. E. (1995) · Cited by 74
Debugging heterogeneous distributed systems using event-based models of behavior
Bates, P. C. (1988) · Workshop on Parallel & Distributed Debugging · doi:10.1145/68210.69217 · Cited by 72
Prototyping a process monitoring experiment
Bradac, M. G., Perry, D. E., & Votta, L. G. (1994) · IEEE Transactions on Software Engineering · doi:10.1109/32.328994 · Cited by 53
A Unified Gradient-Descent/Clustering Architecture for Finite State Machine Induction
Das, S., & Mozer, M. C. (1993) · Cited by 52
Process programming by hindsight
Garg, P. K., & Bhansali, S. (1992) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/143062.143128 · Cited by 15
Grammatical inference: An old and new paradigm
Sakakibara, Y. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60454-5_25 · Cited by 8
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
Workflow mining: discovering process models from event logs
van der Aalst, W., Weijters, T., & Maruster, L. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.47 · Cited by 2,203
The Daikon system for dynamic detection of likely invariants
Ernst, M. D., Perkins, J. H., Guo, P. J., McCamant, S., Pacheco, C., Tschantz, M. S., & Xiao, C. (2007) · Science of Computer Programming · doi:10.1016/j.scico.2007.01.015 · Cited by 1,080
Dynamically discovering likely program invariants to support program evolution
Ernst, M. D., Cockrell, J., Griswold, W. G., & Notkin, D. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.908957 · Cited by 1,050
Fuzzy Mining – Adaptive Process Simplification Based on Multi-perspective Metrics
Günther, C. W., & van der Aalst, W. M. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75183-0_24 · Cited by 890
Business Process Management: A Comprehensive Survey
van der Aalst, W. M. P. (2013) · ISRN Software Engineering · doi:10.1155/2013/507984 · Cited by 828
Metadata
- Authors
- Cook, J. E., & Wolf, A. L.
- Venue
- ACM Transactions on Software Engineering and Methodology
- Published
- 1998-07
- Volume
- 7
- Issue
- 3
- Pages
- 215-249
- ISSN
- 1049-331X (ISSN-L)
- 1557-7392
- OpenAlex
- W2004865374
- Cited by
- 870
- References
- 29
- FWCI
- 27.54
- Type
- journal article
- Language
- en
- Open access
- bronze
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.