Discovering models of behavior for concurrent workflows

Computers in Industry

Volumn 53, Issue 3, 2004, Pages 297-319

  Cook, Jonathan E ^a   Du, Zhidian ^a   Liu, Chongbing ^a   Wolf, Alexander L ^b  

^a New Mexico State University   (United States)

^b University of Colorado at Boulder   (United States)

Author keywords

Behavior inference; Concurrency analysis; Dynamic analysis; Workflow data analysis; Workflow model discovery

Indexed keywords

ALGORITHMS; INFORMATION MANAGEMENT; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBABILITY; SOFTWARE ENGINEERING;

FINITE STATE MACHINES; WORKFLOW DATA LOGS;

DATA REDUCTION;

EID: 0348230609     PISSN: 01663615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compind.2003.10.005     Document Type: Article

References (36)

1. Cook J., Wolf A., Discovering models of software processes from event-based data. ACM Transactions on Software Engineering and Methodology. 7(3):1998;215-249.
2. J. Cook, A. Wolf, Event-based detection of concurrency, in: Proceedings of the Sixth ACM SIGSOFT Symposium on the Foundations of Software Engineering, Association for Computer Machinery, 1998, pp. 35-45.
3. A. Wolf, D. Rosenblum, A study in software process data capture and analysis, in: Proceedings of the Second International Conference on the Software Process, IEEE Computer Society, 1993, pp. 115-124.
4. R. LeBlanc, A. Robbins, Event-driven monitoring of distributed programs, in: Proceedings of the Fifth International Conference on Distributed Computing Systems, IEEE Computer Society, 1985, pp. 515-522.
5. Avrunin G., Buy U., Corbett J., Dillon L., Wileden J., Automated analysis of concurrent systems with the constrained expression toolset. IEEE Transactions on Software Engineering. 17(11):1991;1204-1222.
6. P. Bates, Debugging heterogenous systems using event-based models of behavior, in: Proceedings of a Workshop on Parallel and Distributed Debugging, ACM Press, 1989, pp. 11-22.
7. J. Cuny, G. Forman, A. Hough, J. Kundu, C. Lin, L. Snyder, D. Stemple, The Adriane Debugger: scalable application of event-based abstraction, in: Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, ACM Press, 1993, pp. 85-95.
8. J. Cook, Process discovery and validation through event-data analysis, Technical Report CU-CS-817-96, University of Colorado, Boulder, CO, November 1996.
9. Cook J., Votta L., Wolf A., Cost-effective analysis of in-place software processes. IEEE Transactions on Software Engineering. 24(8):1998;650-663.
10. Peterson J., Petri Nets. ACM Computing Surveys. 9(3):1977;223-252.
11. Harel D., Statecharts: a visual formalism for complex systems. Science of Computer Programming. 8:1987;231-274.
12. J. Devore, Probability and Statistics for Engineering and the Sciences, third ed., Brooks/Cole, Pacific Grove, CA, 1991.
13. E. Koutsofios, S. North, Drawing Graphs with Dot, AT&T Bell Laboratories, October 1993.
14. Angluin D., Smith C., Inductive inference: theory and methods. ACM Computing Surveys. 15(3):1983;237-269.
15. L. Pitt, Inductive inference, DFAs, and computational complexity, in: Analogical and Inductive Inference, vol. 397 of Lecture Notes in Artificial Intelligence (subseries of LNCS), Springer-Verlag, New York, 1989, pp. 18-44.
16. Gold E., Language identification in the limit. Information and Control. 10:1967;447-474.
17. Valiant L., A theory of the learnable. Communications of the ACM. 27:1984;1134-1142.
18. S. Jain, A. Sharma, On monotonic strategies for learning R.E. languages, in: Algorithmic Learning Theory, vol. 872 of Lecture Notes in Artificial Intelligence (subseries of LNCS), Springer-Verlag, New York, 1994, pp. 349-364.
19. S. Lange, J. Nessel, R. Wiehagen, Language learning from good examples, in: Algorithmic Learning Theory, vol. 872 of Lecture Notes in Artificial Intelligence (subseries of LNCS), Springer-Verlag, New York, 1994, pp. 423-437.
20. R. Carrasco, J. Oncina, Learning stochastic regular grammars by means of a state merging method, in: Grammatical Inference and Applications, vol. 862 of Lecture Notes in Artificial Intelligence (subseries of LNCS), Springer-Verlag, New York, 1994, pp. 139-152.
21. L. Miclet, Syntactic and Structural Pattern Recognition: Theory and Applications, vol. 7 of Series in Computer Science: Grammatical Inference, World Scientific, New Jersey, 1990, Chapter 9, pp. 237-290.
22. J. Herbst, Inducing workflow models from workflow instances, in: Proceedings of the SCS Concurrent Engineering Europe Conference, Society for Computer Simulation, 1999.
23. J. Herbst, A machine learning approach to workflow management, in: Proceedings of the 11th European Conference on Machine Learning, vol. 1810, Springer-Verlag, Berlin, 2000, pp. 183-194.
24. J. Herbst, Dealing with concurrency in workflow induction, in: Proceedings of the 7th European Concurrent Engineering Conference (ECEC'2000), 2000.
25. T. Weijters, W. van der Aalst, Process mining: discovering workflow models from event-based data, in: Proceedings of the 13th Belgium-The Netherlands Conference on Artificial Intelligence (BNAIC 2001), 2001, pp. 283-290.
26. T. Weijters, W. van der Aalst, Rediscovering workflow models from event-based data, in: Proceedings of the 11th Dutch-Belgian Conference on Machine Learning (Benelearn 2001), 2001, pp. 93-100.
27. Agrawal R., Gunopulos D., Leymann F., Mining process models from workflow logs. Lecture Notes in Computer Science. 1377:1998;469-483.
28. I. Kruger, R. Grosu, G. Scholz, M. Broy, From MSCs to statecharts, in: Proceedings of the 1998 Distributed and Parallel Embedded Systems, Kluwer Academic Publishers, Dordrecht, 1999, pp. 61-71.
29. S. Some, R. Dssouli, J. Vaucher, From scenarios to timed automata: building specifications from users requirements, in: Proceedings of the 1995 Asia Pacific Software Engineering Conference (IEEE'1998), 1998, pp. 48-57.
30. R. Alur, K. Etessami, M. Yannakakis, Inference of message sequence charts, in: Proceedings of the 22nd International Conference on Software Engineering, 2000, pp. 304-313.
31. T. Systa, Understanding the behavior of Java programs, in: Proceedings of the 2000 Working Conference on Reverse Engineering, 2000, pp. 214-223.
32. Holtzblatt L., Piazza R., Reubenstein H., Roberts S., Harris D., Design recovery for distributed systems. IEEE Transactions on Software Engineering. 23(7):1997;461-472.
33. Venkatesan S., Dathan B., Testing and debugging distributed programs using global predicates. IEEE Transactions on Software Engineering. 21(2):1995;163-177.
34. Diaz M., Juanole G., Courtiat J., Observer - a concept for formal on-line validation of distributed systems. IEEE Transactions on Software Engineering. 20(12):1994;900-913.
35. Cook J., Wolf A., Software process validation: quantitatively measuring the correspondence of a process to a model. ACM Transactions on Software Engineering and Methodology. 8(2):1999;147-176.
36. W. van der Aalst, B. van Dongen, Discovering workflow performance models from timed logs, in: Proceedings of the International Conference on Engineering and Deployment of Cooperative Information Systems (EDCIS 2002), LNCS vol. 2480, 2002, pp. 45-63.