Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Generating a Process Model from a Process Audit Log
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2678/2003
Book
Business Process Management
DOI
10.1007/3-540-44895-0
Copyright
2003
ISBN
978-3-540-40318-0
DOI
10.1007/3-540-44895-0_10
Page
1020
Subject Collection
Computer Science
SpringerLink Date
Wednesday, January 01, 2003
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (528.0 KB)
Free Preview
Generating a Process Model from a Process Audit Log
Mati Golani
7
and Shlomit S. Pinter
7
(7)
IBM Research Laboratory in Haifa, Haifa, 31905, Israel
Abstract
Workflow systems utilize a process model for managing business processes. The model is typically a directed graph annotated with activity names. We view the execution of an activity as a time interval, and present two new algorithms for synthesizing process models from sets of systems’ executions (audit log). A model graph generated by each of the algorithms for a process captures all its executions and dependencies that are present in the log, and preserves existing parallelism.
We compare the model graphs synthesized by our algorithms to those of [
1
] by running them on simulated data. We observe that our graphs are more faithful in the sense that the number of excess and missing edges is consistently smaller and it depends on the size and quality of the log. In other words, we show that our time interval approach permits reconstruction of more accurate workflow model graphs from a log.
Classification: Process mining
Mati
Golani
Email:
matig@il.ibm.com
URL:
http://www-suif.stanford.edu/~shlomit/
Shlomit
S.
Pinter
Email:
shlomit@il.ibm.com
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.105 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)