By Topic

Deadlock-free verification of RosettaNet PIPs with time Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Da-Yin Liao ; Dept. of Inf. Manage., Nat. Chi-Nan Univ., Nantou, Taiwan ; P. R. Liu

This paper deals with the verification problem of RosettaNet. The RosettaNet PIPs specifications are first modelled with time Petri nets (TPNs) which allow an explicit modelling of concurrency and parallelism. We demonstrate that RosettaNet PIPs are deadlock-free in both the deterministic and stochastic operational environments. A patch subnet technique is developed to improve the efficiency of RosettaNet PIPs. We also suggest to remove some steps defined in RosettaNet PIPs that are proved to never take place.

Published in:

Systems, Man and Cybernetics, 2003. IEEE International Conference on  (Volume:3 )

Date of Conference:

5-8 Oct. 2003