Compositional time Petri nets and reduction rules

Citation
Jc. Wang et al., Compositional time Petri nets and reduction rules, IEEE SYST B, 30(4), 2000, pp. 562-572
Citations number
20
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
ISSN journal
10834419 → ACNP
Volume
30
Issue
4
Year of publication
2000
Pages
562 - 572
Database
ISI
SICI code
1083-4419(200008)30:4<562:CTPNAR>2.0.ZU;2-4
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 co nnectors. The paper also proposes a set of component-level reduction rules for TPNs, Each of these reduction rules transforms a TPN component to a ver y simple one while maintaining the net's external observable timing propert ies. Consequently, the proposed method works at a coarse level rather than at an individual transition level. Therefore, one requires significantly fe wer applications to reduce the size of the TPN under analysis than those ex isting 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 c ontrol system to its external arriving messages.