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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
