To access the full text documents, please follow this link: http://hdl.handle.net/2117/91283

An SMT-based discovery algorithm for C-nets
Solé Simó, Marc; Carmona Vargas, Josep
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
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.
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
-Binary search
-Complex behavior
-Declarative semantics
-Discovery algorithm
-Process Discovery
Article - Published version
Report
         

Show full item record

Related documents

Other documents of the same author

Sánchez Charles, David; Carmona Vargas, Josep; Muntés Mulero, Victor; Solé Simó, Marc
Solé Simó, Marc; Carmona Vargas, Josep
Solé Simó, Marc; Carmona Vargas, Josep
Herranz Sotoca, Javier; Nin Guerrero, Jordi; Solé Simó, Marc
Herranz Sotoca, Javier; Nin Guerrero, Jordi; Solé Simó, Marc
 

Coordination

 

Supporters