Translating message sequence charts to other process languages using process mining

K.B. Lassen, B.F. Dongen, van

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

Message Sequence Charts (MSCs) are often used by software analysts when discussing the behavior of a system with different stakeholders. Often such discussions lead to more complete behavioral models in the form of, e.g., Event-driven Process Chains (EPCs), Unified Modeling Language (UML), activity diagrams, Business Process Modeling Notation (BPMN) models, Petri nets, etc. Process mining on the other hand, deals with the problem of constructing complete behavioral models by analyzing event logs of information systems. In contrast to existing process mining techniques, where logs are assumed to only contain implicit information, the approach presented in this paper combines the explicit knowledge captured in individual MSCs and the techniques and tools available in the process mining domain. This combination allows us to discover high-quality process models. To constructively add to the existing work on process mining, our approach has been implemented in the process mining framework ProM (www.processmining.org).
Original languageEnglish
Title of host publicationTransactions on Petri Nets and Other Models of Concurrency I
EditorsK. Jensen, W.M.P. Aalst, van der, J. Billington
Place of PublicationBerlin
PublisherSpringer
Pages71-85
ISBN (Print)978-3-540-89286-1
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
Volume5100
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Translating message sequence charts to other process languages using process mining'. Together they form a unique fingerprint.

  • Cite this

    Lassen, K. B., & Dongen, van, B. F. (2008). Translating message sequence charts to other process languages using process mining. In K. Jensen, W. M. P. Aalst, van der, & J. Billington (Eds.), Transactions on Petri Nets and Other Models of Concurrency I (pp. 71-85). (Lecture Notes in Computer Science; Vol. 5100). Berlin: Springer. https://doi.org/10.1007/978-3-540-89287-8_5