dc.creator | Gómez López, María Teresa | es |
dc.creator | Borrego Núñez, Diana | es |
dc.creator | Carmona, Josep | es |
dc.creator | Martínez Gasca, Rafael | es |
dc.date.accessioned | 2019-05-14T08:32:07Z | |
dc.date.available | 2019-05-14T08:32:07Z | |
dc.date.issued | 2016 | |
dc.identifier.citation | Gómez López, M.T., Borrego Núñez, D., Carmona, J. y Martínez Gasca, R. (2016). Computing alignments with constraint programming : the acyclic case. En ATAED 2016 : International Workshop on Algorithms and Theories for the Analysis of Event Data (96-110), Torun, Poland: CEUR-WS.Org. | |
dc.identifier.issn | 1613-0073 | es |
dc.identifier.uri | https://hdl.handle.net/11441/86313 | |
dc.description.abstract | Conformance checking confronts process models with real
process executions to detect and measure deviations between modelled
and observed behaviour. The core technique for conformance checking
is the computation of an alignment. Current approaches for alignment
computation rely on a shortest-path technique over the product of the
state-space of a model and the observed trace, thus suffering from the
well-known state explosion problem. This paper presents a fresh alternative
for alignment computation of acyclic process models, that encodes
the alignment problem as a Constraint Satisfaction Problem. Since modern
solvers for this framework are capable of dealing with large instances,
this contribution has a clear potential. Remarkably, our prototype implementation
can handle instances that represent a real challenge for current
techniques. Main advantages of using Constraint Programming paradigm
lie in the possibility to adapt parameters such as the maximum search
time, or the maximum misalignment allowed. Moreover, using search and
propagation algorithms incorporated in Constraint Programming Solvers
permits to find solutions for problems unsolvable with other techniques. | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad TIN2015-63502-C3-2-R | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad TIN2013-46181-C2-1-R | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | CEUR-WS.Org | es |
dc.relation.ispartof | ATAED 2016 : International Workshop on Algorithms and Theories for the Analysis of Event Data (2016), p 96-110 | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Conformance Checking | es |
dc.subject | Constraint Programming | es |
dc.title | Computing alignments with constraint programming : the acyclic case | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessrights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos | es |
dc.relation.projectID | TIN2015-63502-C3-2-R | es |
dc.relation.projectID | TIN2013-46181-C2-1-R | es |
dc.relation.publisherversion | http://ceur-ws.org/Vol-1592/ | es |
idus.format.extent | 15 | es |
dc.publication.initialPage | 96 | es |
dc.publication.endPage | 110 | es |
dc.eventtitle | ATAED 2016 : International Workshop on Algorithms and Theories for the Analysis of Event Data | es |
dc.eventinstitution | Torun, Poland | es |
dc.relation.publicationplace | Aachen, Germany | es |