Abstract
This chapter addresses a sampling problem for timed continuous Petri nets under infinite servers semantics. Different representations of the continuous Petri net system are given, the first two in terms of piecewise linear system and the third one, for the controlled continuous Petri nets systems, in terms of a particular linear constrained system with null dynamic matrix. Discrete Petri nets (PNs) (Silva) are a mathematical formalism with an appealing graphical representation for the description of discrete-event systems, successfully used for modeling, analysis and synthesis of such systems. Discrete PNs suffer the state explosion problem, when the number of tokens is large. As in the case of other formalisms, continuous relaxation provides a good approximation for discrete models under certain circumstances.
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 callDisclaimer: 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.
