Abstract

In this paper, we show how a decomposition of a free choice Petri net into a 'routing' network and marked graph subnetworks (i.e. linear subnetworks in the [max,+] setting) leads to new methods and algorithms to test structural as well as temporal properties of the net. We show how this decomposition allows one to: (in the timed case) establish evolution equations which involve two linear systems, a (min,+)-linear system, and a quasi (+,/spl times/)-linear one; (in the stochastic case) check stability i.e. the fact that the marking remains bounded in probability. The main tools for proving these properties are graph theory, idempotent algebras and ergodic theory.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.