A State Class Approach to Time Petri Nets with Weak Semantics

Author

Pan, Li ; Zhao, Weidong ; Wang, Zhicheng ; Zhou, Xinmin

Author_Institution

Res. Center of CAD, Tongji Univ., Shanghai

Volume

2

fYear

2008

fDate

12-14 Dec. 2008

Firstpage

772

Lastpage

775

Abstract

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.

Keywords

Petri nets; programming language semantics; reachability analysis; formal semantics; labeled transition system; reachability analysis; state class approach; state class methods; time Petri nets; time semantics; weak semantics model; Clocks; Computer science; Fires; Job shop scheduling; Manufacturing systems; Petri nets; Reachability analysis; Real time systems; Software engineering; Upper bound; State Classes; Strong semantics; Time Petri Nets; Weak Semantics;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Software Engineering, 2008 International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-0-7695-3336-0

Type

conf

DOI

10.1109/CSSE.2008.1073

Filename

4722163