Reducing complexity of large EPCs
dc.contributor.author | Polyvyanyy, Artem | |
dc.contributor.author | Smirnov, Sergey | |
dc.contributor.author | Weske, Mathias | |
dc.contributor.editor | Loos, Peter | |
dc.contributor.editor | Nüttgens, Markus | |
dc.contributor.editor | Turowski, Klaus | |
dc.contributor.editor | Werth, Dirk | |
dc.date.accessioned | 2019-06-04T12:12:44Z | |
dc.date.available | 2019-06-04T12:12:44Z | |
dc.date.issued | 2008 | |
dc.description.abstract | Business processes are an important instrument for understanding and improving how companies provide goods and services to customers. Therefore, many companies have documented their business processes well, often in the Event-driven Process Chains (EPC). Unfortunately, in many cases the resulting EPCs are rather complex, so that the overall process logic is hidden in low level process details. This paper proposes abstraction mechanisms for process models that aim to reduce their complexity, while keeping the overall process structure. We assume that functions are marked with efforts and splits are marked with probabilities. This information is used to separate important process parts from less important ones. Real world process models are used to validate the approach. | en |
dc.identifier.isbn | 978-3-88579-235-2 | |
dc.identifier.pissn | 1617-5468 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/23608 | |
dc.language.iso | en | |
dc.publisher | Gesellschaft für Informatik e.V. | |
dc.relation.ispartof | Modellierung betrieblicher Informationssysteme (MobIS 2008) | |
dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-141 | |
dc.title | Reducing complexity of large EPCs | en |
dc.type | Text/Conference Paper | |
gi.citation.endPage | 207 | |
gi.citation.publisherPlace | Bonn | |
gi.citation.startPage | 195 | |
gi.conference.date | 27.-28. November 2008 | |
gi.conference.location | Saarbrücken | |
gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1