A Region-Based Algorithm for Discovering Petri Nets from Event Logs
- 1 January 2008
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Symbolic Algorithm for the Synthesis of Bounded Petri NetsLecture Notes in Computer Science, 2008
- Process Mining Based on Regions of LanguagesPublished by Springer Science and Business Media LLC ,2007
- ProM 4.0: Comprehensive Support for Real Process AnalysisLecture Notes in Computer Science, 2007
- Workflow mining: A survey of issues and approachesData & Knowledge Engineering, 2003
- Deriving Petri nets from finite transition systemsInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1998
- The synthesis problem of Petri netsActa Informatica, 1996
- Polynomial algorithms for the synthesis of bounded netsLecture Notes in Computer Science, 1995
- Elementary transition systemsTheoretical Computer Science, 1992
- Partial (set) 2-structuresActa Informatica, 1990
- Determinancy → (observation equivalence = trace equivalence)Theoretical Computer Science, 1985