A State Class Approach to Time Petri Nets with Weak Semantics

Two time semantics are usually adopted for time Petri nets (TPNs) in different application context: a strong semantics and a weak one. State class approaches are a fundamental and most widely applied technique for reachability analysis in TPNs. But the existing state class methods focus on the strong semantics. In this paper, we define the formal semantics of TPNs with weak semantics in terms of Labeled Transition System, and propose a state class method for the weak semantics model. Finally, an application of this method to a typical manufacturing system is illustrated.