By Topic

Applications of conflict-free Petri nets to parallel programs and asynchronous circuits

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

1 Author(s)
Hsu-Chun Yen ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan

The author composes a unified approach for dealing with the race detection problem for two entirely different models, namely, parallel programs and asynchronous circuits. It is shown that the problem of determining whether two transitions in a one-bounded conflict-free Petri net can become enabled simultaneously is solvable in polynomial time. This is referred to as the pairwise concurrency problem. It is then shown that the race detection problem for parallel programs (asynchronous circuits) and the pairwise concurrency problem for Petri nets are closely related to each other. As a result, race conditions can be detected efficiently for those parallel programs and asynchronous circuits that can be modeled by one-bounded conflict-free Petri nets.<>

Published in:

Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on

Date of Conference:

1-3 April 1992