Loading...
Loading...

Go to the content (press return)

An SMT-based discovery algorithm for C-nets

Author
Sole, M.; Carmona, J.
Type of activity
Report
Date
2012
Code
LSI-12-2-R
Repository
http://hdl.handle.net/2117/91283 Open in new window
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 experiment...
Citation
Solé, M., Carmona, J. "An SMT-based discovery algorithm for C-nets". 2012.
Keywords
Binary search, Complex behavior, Declarative semantics, Discovery algorithm, Process Discovery
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments