Skip to main content
Article thumbnail
Location of Repository

An SMT-based discovery algorithm for C-nets

By Marc Solé Simó and Josep Carmona Vargas

Abstract

Recently, Causal nets have been proposed as a suitable model for process discovery, due to their declarative semantics and the great expressiveness they possess. In this paper we propose an algorithm to discover a causal net from a set of traces. It is based on encoding the problem as a Satisfiability Modulo Theories (SMT) formula, and uses a binary search strategy to optimize the derived model. The method has been implemented in a prototype tool that interacts with an SMT solver. The experimental results obtained witness the capability of the approach to discover complex behavior in limited time.Postprint (published version

Topics: Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica, Binary search, Complex behavior, Declarative semantics, Discovery algorithm, Process Discovery
Year: 2012
OAI identifier: oai:upcommons.upc.edu:2117/91283

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.