Optimal trajectory generation for Petri nets

Gyapay, Szilvia and Pataricza, András: Optimal trajectory generation for Petri nets. In: Acta cybernetica, (17) 2. pp. 225-245. (2005)

[img]
Preview
Cikk, tanulmány, mű
Gyapay_2005_ActaCybernetica.pdf

Download (237kB) | Preview

Abstract

Recently, the increasing complexity of IT systems requires the early verification and validation of the system design in order to avoid the costly redesign. Furthermore, the efficiency of system operation can be improved by solving system optimization problems (like resource allocation and scheduling problems). Such combined optimization and validation, verification problems can be typically expressed as reachability problems with quantitative or qualitative measurements. The current paper proposes a solution to compute the optimal trajectories for Petri net-based reachability problems with cost parameters. This is an improved variant of the basic integrated verification and optimization method introduced in [11] combining the efficiency of Process Network Synthesis optimization algorithms with the modeling power of Petri nets.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2005
Volume: 17
Number: 2
ISSN: 0324-721X
Page Range: pp. 225-245
Language: angol
Event Title: Conference for PhD Students in Computer Science, 4., 2004, Szeged
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 243-245.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 14:52
URI: http://acta.bibl.u-szeged.hu/id/eprint/12764

Actions (login required)

View Item View Item