Abstract
This paper discusses the use of Petri net languages, particularly, its subclass “timed event graph” for modeling a public transport network. The behavior of the network is described by a particular algebraic structure called (max, +) algebra. We show that the modeling of such a network is possible under some hypotheses. We propose a Petri net tool with some conflicts to model this network without taking into account these assumptions. The behavior of this Petri net in (max, +) algebra is presented. An example is given to illustrate our results.
Sign-in/Register to access full text options 
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.
