DocumentCode
1375938
Title
Compositional time Petri nets and reduction rules
Author
Wang, Jiacun ; Deng, Yi ; Zhou, MengChu
Author_Institution
Sch. of Comput. Sci., Florida Int. Univ., Miami, FL, USA
Volume
30
Issue
4
fYear
2000
fDate
8/1/2000 12:00:00 AM
Firstpage
562
Lastpage
572
Abstract
This paper introduces compositional time Petri net (CTPN) models. A CTPN is a modularized time Petri net (TPN), which is composed of components and connectors. The paper also proposes a set of component-level reduction rules for TPNs. Each of these reduction rules transforms a TPN component to a very simple one while maintaining the net´s external observable timing properties. Consequently, the proposed method works at a coarse level rather than at an individual transition level. Therefore, one requires significantly fewer applications to reduce the size of the TPN under analysis than those existing ones for TPNs. The use and benefits of CTPNs and reduction rules are illustrated by modeling and analyzing the response time of a command and control system to its external arriving messages
Keywords
Petri nets; discrete event systems; formal verification; timing; command and control system; compositional time Petri nets; external observable timing properties; modularized time Petri net; reduction rules; Command and control systems; Computer science; Connectors; Delay; Formal verification; Parallel processing; Petri nets; Power system modeling; Stochastic processes; Timing;
fLanguage
English
Journal_Title
Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
1083-4419
Type
jour
DOI
10.1109/3477.865173
Filename
865173
Link To Document