Synthesis and Analysis of Product-form Petri Nets

Details Synthesis and Analysis of Product-form Petri Nets Synthesis and Analysis of Product-form Petri Nets

2011-04-02

arxiv.org/abs/1104.0291v2

Computer Science

Discrete Mathematics

This is a version including proofs of the conference paper: Haddad, Mairesse and Nguyen. Synthesis and Analysis of Product-for

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Synthesis and Analysis of Product-form Petri Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Synthesis and Analysis of Product-form Petri Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synthesis and Analysis of Product-form Petri Nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334723