Section: New Results

Product form for Petri nets

While product-form Petri nets have been intensively studied some important questions were left open. In [52] , we have solved most of the open problems. We have provided a sound and complete set of rules to synthetise product form Petri nets. We have characterized the complexity class of standard problems (liveness, reachability and cover ability). At last we have proposed a large subclass of product form Petri nets for which the normalising constant (a key quantity) can be efficiently computed. This paper has obtained the outstanding paper award of the ATPN'2011 conference.