Abstract
This article points out the influence of the time increment in numerical algorithms that concern Petri nets models. Shorts algorithms are proposed for T-timed Petri nets and continuous Petri nets with variable speeds to provide the marking evolution. Numerical errors are discussed in both cases. Concerning T-timed Petri nets, conditions are given such that numerical errors do not arise. Concerning continuous Petri nets with variable speeds the numerical errors are related to the solver and to the time increment. An example is proposed to point out the importance of the time increment choice.
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.
