Resource-Wokflow Petri Nets with Time Tokens and Their Application in Process Management
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27510%2F21%3A10247936" target="_blank" >RIV/61989100:27510/21:10247936 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-84340-3_34" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-84340-3_34</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-84340-3_34" target="_blank" >10.1007/978-3-030-84340-3_34</a>
Alternative languages
Result language
angličtina
Original language name
Resource-Wokflow Petri Nets with Time Tokens and Their Application in Process Management
Original language description
Resource-workflow Petri nets with time tokens (RWPNTT) are the newly-introduced class of low-level process Petri nets in this article. The theory of RWPNTT can be successfully applied especially in modeling processes for which the lower and upper limits of the duration of their activities are specified and in determining their lower and upper duration limits of the time-optimal critical steps and paths. RWPNTT theory also generalizes the original process model used by the CPM method in the direction that each activity may require a limited set of resources (e.g., energy, financial, material, etc.) for its exclusive use and successful completion that are shared by other activities of the same process. The concept of global network time is not explicitly introduced in the definition of the class of RWPNTT and it is then used only implicitly within the mechanism of the transition firing. The new RWPNTT class also enables the analysis of other process properties by using well-known methods of Petri nets theory. These properties of RWPNTT class are demonstrated on the simple process examples in this article. (C) 2021, Springer Nature Switzerland AG.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Volume 12883
ISBN
978-3-030-84339-7
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
418-430
Publisher name
Springer
Place of publication
Cham
Event location
Ełk
Event date
Sep 24, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—