Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/23130
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJOUCK, Toon-
dc.contributor.authorDEPAIRE, Benoit-
dc.date.accessioned2017-02-17T15:02:57Z-
dc.date.available2017-02-17T15:02:57Z-
dc.date.issued2017-
dc.identifier.urihttp://hdl.handle.net/1942/23130-
dc.description.abstractThe Process Tree notation is an emerging language for modeling block-structured processes. A Process Tree is inherently sound and therefore proves to be the ideal input of a simulator as it can never deadlock. However, most business process simulation tools require a translation to Petri Nets. This technical paper proposes a simulation tool for Process Trees based on the principles of discrete-event simulation (DES) that accepts a Process Tree as input. The proposed implementation benefits from the extensive work that has already been done on DES, including software packages to execute DES simulation. The simulation algorithms and implementations are free to download and use.-
dc.language.isoen-
dc.publisherHasselt University-
dc.subject.otherartificial event logs; process trees; simulation-
dc.titleSimulating Process Trees Using Discrete-Event Simulation-
dc.typeResearch Report-
local.format.pages18-
local.bibliographicCitation.jcatR2-
local.publisher.placeHasselt, Belgium-
local.type.specifiedResearch Report-
dc.identifier.doi10.13140/RG.2.2.25488.00009-
item.fulltextWith Fulltext-
item.contributorJOUCK, Toon-
item.contributorDEPAIRE, Benoit-
item.fullcitationJOUCK, Toon & DEPAIRE, Benoit (2017) Simulating Process Trees Using Discrete-Event Simulation.-
item.accessRightsOpen Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
TechnicalSimulation.pdfPeer-reviewed author version633.23 kBAdobe PDFView/Open
Show simple item record

Page view(s)

32
checked on Sep 7, 2022

Download(s)

96
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.