Process Petri Nets with Time Stamps and Their Using in Project Management

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27510%2F18%3A10239104" target="_blank" >RIV/61989100:27510/18:10239104 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.intechopen.com/books/petri-nets-in-science-and-engineering/process-petri-nets-with-time-stamps-and-their-using-in-project-management" target="_blank" >https://www.intechopen.com/books/petri-nets-in-science-and-engineering/process-petri-nets-with-time-stamps-and-their-using-in-project-management</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.5772/intechopen.76769" target="_blank" >10.5772/intechopen.76769</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Process Petri Nets with Time Stamps and Their Using in Project Management

Popis výsledku v původním jazyce

Process Petri nets with time stamps (PPNTS) are the newly introduced class of low-level Petri nets, whose definition and the properties are the main topic of this chapter; they generalize the properties of Petri net processes in the area of design, modeling and verification of generally parallel systems with the discrete time. Property-preserving Petri net process algebras (PPPAs) were originally designed for the specification and verification of manufacturing systems. PPPA does not need to verify composition of Petri net processes because all their algebraic operators preserve the specified set of the properties. These original PPPAs are generalized for the class of the PPNTSs in this chapter. The new COMP, SYNC and JOIN algebraic operators are defined for the class of PPNTS and their chosen properties are proved. With the support of these operators, the PPNTSs can be extended also to the areas of project management and the determination of the project critical path with the support of the critical path method (CPM). The new CPNET subclass of PPNTS class is defined in this chapter. It is specially designed for the generalization of the CPM activity charts and their properties. This fact is then demonstrated on the simple project example and its critical path and other property specifications.

Název v anglickém jazyce

Process Petri Nets with Time Stamps and Their Using in Project Management

Popis výsledku anglicky

Process Petri nets with time stamps (PPNTS) are the newly introduced class of low-level Petri nets, whose definition and the properties are the main topic of this chapter; they generalize the properties of Petri net processes in the area of design, modeling and verification of generally parallel systems with the discrete time. Property-preserving Petri net process algebras (PPPAs) were originally designed for the specification and verification of manufacturing systems. PPPA does not need to verify composition of Petri net processes because all their algebraic operators preserve the specified set of the properties. These original PPPAs are generalized for the class of the PPNTSs in this chapter. The new COMP, SYNC and JOIN algebraic operators are defined for the class of PPNTS and their chosen properties are proved. With the support of these operators, the PPNTSs can be extended also to the areas of project management and the determination of the project critical path with the support of the critical path method (CPM). The new CPNET subclass of PPNTS class is defined in this chapter. It is specially designed for the generalization of the CPM activity charts and their properties. This fact is then demonstrated on the simple project example and its critical path and other property specifications.

Druh

C - Kapitola v odborné knize

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název knihy nebo sborníku

Petri nets in science and engineering

ISBN

978-1-78923-692-7

Počet stran výsledku

23

Strana od-do

111-133

Počet stran knihy

144

Název nakladatele

IntechOpen

Místo vydání

Londýn

Kód UT WoS kapitoly

—