skip to main content
10.1145/2480362.2480628acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Amending C-net discovery algorithms

Published:18 March 2013Publication History

ABSTRACT

As the complexity of information systems evolves, there is a growing interest in defining suitable process models than can overcome the limitations of traditional formalisms like Petri nets or related. Causal nets may be one of such process models, since their declarative semantics and simple graph structure deviates from existing formalisms. Due to their novelty, few discovery algorithms exist for Causal nets. Moreover, the existing ones offer poor guarantees regarding the produced outcome. We describe an algorithm that can be applied as a second step to any discovery technique to improve the quality of the Causal net derived. We have tested the technique in combination with the existing algorithms in the literature, noticing a considerable improvement.

References

  1. A. Adriansyah, B. van Dongen, and W. van der Aalst. Conformance checking using cost-based fitness analysis. In EDOC, pages 55--64, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. M. de Moura and N. Bjørner. Satisfiability modulo theories: introduction and applications. Commun. ACM, 54(9):69--77, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Munoz-Gama and J. Carmona. A Fresh Look at Precision in Process Conformance. In Business Process Management (BPM), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Rozinat and W. M. P. van der Aalst. Conformance checking of processes based on monitoring real behavior. Information and Systems, 33(1):64--95, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Solé and J. Carmona. Amending C-net discovery algorithms. Technical Report LSI-12-6-R, 2012.Google ScholarGoogle Scholar
  6. M. Solé and J. Carmona. A high-level strategy for C-net discovery. In ACSD, pages 102--111, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Solé and J. Carmona. An SMT-based discovery algorithm for C-nets. In ATPN, pages 51--71, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. van der Aalst, A. Adriansyah, and B. van Dongen. Causal nets: a modeling language tailored towards process discovery. In CONCUR, pages 28--42, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. M. P. van der Aalst. Process Mining - Discovery, Conformance and Enhancement of Business Processes. Springer, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. M. P. van der Aalst, A. K. A. de Medeiros, and A. J. M. M. Weijters. Genetic process mining. In ICATPN, volume 3536 of LNCS, pages 48--69, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. W. M. P. van der Aalst, T. Weijters, and L. Maruster. Workflow mining: Discovering process models from event logs. IEEE TKDE, 16(9):1128--1142, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Weijters, W. van der Aalst, and A. A. de Medeiros. Process mining with the heuristics miner-algorithm. Technical Report WP 166, BETA Working Paper Series, Eindhoven University of Technology, 2006.Google ScholarGoogle Scholar
  13. A. J. M. M. Weijters and J. T. S. Ribeiro. Flexible heuristics miner (FHM). In CIDM, pages 310--317. IEEE, 2011.Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
    March 2013
    2124 pages
    ISBN:9781450316569
    DOI:10.1145/2480362

    Copyright © 2013 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 18 March 2013

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    SAC '13 Paper Acceptance Rate255of1,063submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader