Synthesis and Analysis of Product-form Petri Nets - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2013

Synthesis and Analysis of Product-form Petri Nets

Abstract

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-formPetri 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.
No file

Dates and versions

hal-00925774 , version 1 (08-01-2014)

Identifiers

Cite

Serge Haddad, Jean Mairesse, Hoang-Thach Nguyen. Synthesis and Analysis of Product-form Petri Nets. Fundamenta Informaticae, 2013, 122 (1-2), pp.147-172. ⟨10.3233/FI-2013-786⟩. ⟨hal-00925774⟩
134 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More