Abstract
Based on some modeling primitives from automata, Petri nets and process algebra, an architecture for a general routing and resource booking problem is presented. The architecture is based on general models for a set of resources, desired routing specifications for a set of objects (products, data packets, vehicles) and a controller that synchronizes the objects utilization of the available resources. High level graphical routing specifications for the objects are also introduced, together with corresponding Petri nets, in order to simplify the specification of desired routes. Two specific operators, event synchronization and arbitrary order including an algebra of events, are then used in the formal Petri net specifications.
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.
