Abstract
Several semantics models are adopted by time Petri nets for different applications. Yet they have some limitations on schedulability analysis of flexible manufacturing systems. The scheduling scope of a strong semantics model is greatly limited because of the impact of strong timing requirements, perhaps keeping some optimal schedules out of the consideration. A weak semantics model cannot guarantee the scheduling timeliness as there lacks strong timing enforcement. A mixed semantics model cannot ensure that independent transitions with overlapping firing interval fire in an interleaving way, thus affecting the search for the optimal schedules. In this paper, we present a relaxed mixed semantics model for time Petri nets to address these problems by redefining the firability rules of transitions. In our model, the firability of a transition is determined by maximal concurrent sets containing the transition. This treatment not only extends the scheduling scope of TPN model greatly while avoiding the generation of invalid schedules, but also solves the problem of concurrent scheduling of independent transitions. A state class method is then proposed to support the verification and analysis of temporal properties. Finally, we apply the proposed model to schedulability analysis of a job shop scheduling problem, and compare the features of four semantics models.