Mostrar el registro sencillo del ítem

Ponencia

dc.creatorGómez López, María Teresaes
dc.creatorBorrego Núñez, Dianaes
dc.creatorCarmona, Josepes
dc.creatorMartínez Gasca, Rafaeles
dc.date.accessioned2019-05-14T08:32:07Z
dc.date.available2019-05-14T08:32:07Z
dc.date.issued2016
dc.identifier.citationGó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.issn1613-0073es
dc.identifier.urihttps://hdl.handle.net/11441/86313
dc.description.abstractConformance 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.sponsorshipMinisterio de Economía y Competitividad TIN2015-63502-C3-2-Res
dc.description.sponsorshipMinisterio de Economía y Competitividad TIN2013-46181-C2-1-Res
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherCEUR-WS.Orges
dc.relation.ispartofATAED 2016 : International Workshop on Algorithms and Theories for the Analysis of Event Data (2016), p 96-110
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectConformance Checkinges
dc.subjectConstraint Programminges
dc.titleComputing alignments with constraint programming : the acyclic casees
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticoses
dc.relation.projectIDTIN2015-63502-C3-2-Res
dc.relation.projectIDTIN2013-46181-C2-1-Res
dc.relation.publisherversionhttp://ceur-ws.org/Vol-1592/es
idus.format.extent15es
dc.publication.initialPage96es
dc.publication.endPage110es
dc.eventtitleATAED 2016 : International Workshop on Algorithms and Theories for the Analysis of Event Dataes
dc.eventinstitutionTorun, Polandes
dc.relation.publicationplaceAachen, Germanyes

FicherosTamañoFormatoVerDescripción
paper07.pdf271.4KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional