<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-13T07:06:22Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/130975" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/130975</identifier><datestamp>2026-01-30T07:22:37Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>A region-based algorithm for discovering Petri nets from event logs</dc:title>
   <dc:creator>Carmona Vargas, Josep</dc:creator>
   <dc:creator>Cortadella, Jordi</dc:creator>
   <dc:creator>Kishinevsky, Michael</dc:creator>
   <dc:subject>Àrees temàtiques de la UPC::Informàtica::Sistemes d'informació</dc:subject>
   <dc:subject>Data mining</dc:subject>
   <dc:subject>Petri nets</dc:subject>
   <dc:subject>Region-based algorithm</dc:subject>
   <dc:subject>Event logs</dc:subject>
   <dc:subject>Process mining</dc:subject>
   <dc:subject>Mineria de dades</dc:subject>
   <dc:subject>Petri, Xarxes de</dc:subject>
   <dcterms:abstract>The paper presents a new method for the synthesis of Petri nets from event logs in the area of Process Mining. The method derives a bounded Petri net that over-approximates the behavior of an event log. The most important property is that it produces a net with the smallest behavior that still contains the behavior of the event log. The methods described in this paper have been implemented in a tool and tested on a set of examples.</dcterms:abstract>
   <dcterms:abstract>Peer Reviewed</dcterms:abstract>
   <dcterms:abstract>Postprint (author's final draft)</dcterms:abstract>
   <dcterms:issued>2008</dcterms:issued>
   <dc:type>Conference report</dc:type>
   <dc:relation>https://link.springer.com/chapter/10.1007/978-3-540-85758-7_26</dc:relation>
   <dc:rights>Open Access</dc:rights>
   <dc:publisher>Springer</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>