Mostra el registre d'ítem simple

An SMT-based discovery algorithm for C-nets

dc.contributor.authorSolé Simó, Marc
dc.contributor.authorCarmona Vargas, Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-10-31T14:23:38Z
dc.date.available2016-10-31T14:23:38Z
dc.date.issued2012
dc.identifier.citationSolé, M., Carmona, J. "An SMT-based discovery algorithm for C-nets". 2012.
dc.identifier.urihttp://hdl.handle.net/2117/91283
dc.description.abstractRecently, 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.
dc.format.extent20 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-12-2-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherBinary search
dc.subject.otherComplex behavior
dc.subject.otherDeclarative semantics
dc.subject.otherDiscovery algorithm
dc.subject.otherProcess Discovery
dc.titleAn SMT-based discovery algorithm for C-nets
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac19240549
dc.description.versionPostprint (published version)
local.citation.authorSolé, M.; Carmona, J.


Fitxers d'aquest items

Thumbnail
Nom:
R12-2.pdf
Mida:
584,5Kb
Format:
PDF
Visualitza/Obre

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple