Close category search window
 

Algorithm modelling with Petri nets-comparison with data dependence graphs

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
$31 $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)
Hanzalek, Z. ; Dept. of Control Eng., Czech Tech. Univ., Prague, Czech Republic

This article focuses on algorithm representation by means of Petri nets and data dependence graphs. In order to detect antidependencies and output dependencies in Petri net representation we have introduced a term IP-dependencies (instruction-pointer-related data interactions). This original approach allows us to put knowledge of automatic parallelization via data dependence graphs and Petri nets onto the same theoretical platform and to join the two scientific branches.

Published in:
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on  (Volume:1 )

Date of Conference: 11-14 Oct 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.