Year-end Sale % OFF 
Abstract
In this paper, we propose a mathematical programming model for the resolution of the reachability problem in Time Petri Nets. We are more particularly interested in unweighted Time Petri Nets with safe markings and weak time semantics.
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.
