For a large Markovian model, a "product form" is an explicit description of the steady-state behaviour which is otherwise generally untractable. Being first introduced in queueing networks, it has been adapted to Markovian Petri nets. Here we address three relevant issues for product-form Petri nets which were left fully or partially open: (1) we provide a sound and complete set of rules for the synthesis; (2) we characterise the exact complexity of classical problems like reachability; (3) we introduce a new subclass for which the normalising constant (a crucial value for product-form expression) can be efficiently computed. © 2011 Springer-Verlag.
CITATION STYLE
Haddad, S., Mairesse, J., & Nguyen, H. T. (2011). Synthesis and analysis of product-form Petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6709 LNCS, pp. 288–307). https://doi.org/10.1007/978-3-642-21834-7_16
Mendeley helps you to discover research relevant for your work.