Process Petri Nets with Time Stamps and Their Using in Project Management
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Process Petri Nets with Time Stamps and Their Using in Project Management
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2018
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
Book/collection name
Petri nets in science and engineering
ISBN
978-1-78923-692-7
Number of pages of the result
23
Pages from-to
111-133
Number of pages of the book
144
Publisher name
IntechOpen
Place of publication
Londýn
UT code for WoS chapter
—