Abstract
This paper introduces a class of High-Level Petri Nets, called τ-nets, used for the analysis, description, and sub-optimal solution of a general class of problems of process scheduling. τ-nets include timed transitions, a type-checking mechanism, and the definition of taxonomic hierarchies of token types. Objects are typed, including transitions, places, tokens, and the (sub)nets that can be built combining those elements. Furthermore, transitions and tokens belong to two disjoint hierarchies of types supporting a single inheritance mechanism. A class of problems in the FMS area is taken as a reference scenario in the paper. The approach described in this paper is at the basis of a joint project with industrial partners for the development of a CASE tool for the simulation of blast furnaces.
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.
