Seamless Simplification of Timed-CPN in Project Plan Formalization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F08%3APU76766" target="_blank" >RIV/00216305:26230/08:PU76766 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Seamless Simplification of Timed-CPN in Project Plan Formalization
Original language description
We have recently used Timed Colored Petri Nets (Timed-CPN) to improve possibilities of project plans based on network diagrams and to give a formal background to this improvement. Algorithmically created Timed-CPN provides required features, but it may be too complex in some of its sub-areas. The paper presents a specification of such elements of a Timed-CPN that can be eliminated with no impact on time behavior of the complete net. The elimination can be done algorithmically. Thus, we can reduce largenets in size automatically, which improves readability of the model on the Timed-CPN level.
Czech name
Seamless Simplification of Timed-CPN in Project Plan Formalization
Czech description
Příspěvek popisuje algoritmický převod síťového diagramu do Časované barvené Petriho sítě. Ukazuje rovněž možnosti optimalizace vybraných parametrů projektu.

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

Article name in the collection
3rd IFIP Central and Eastern European Conference on Software Engineering Techniques CEE-SET 2008
ISBN
978-83-7493-421-3
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
—
Publisher name
Wroclaw University of Technology
Place of publication
Wroclaw
Event location
Brno, Hotel Continental
Event date
Oct 13, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)