Cart (Loading....) | Create Account
Close category search window
 

Relational Petri nets with start/stop place

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

2 Author(s)
Karci, A. ; Dept. of Comput. Eng., Firat Univ., Elazig, Turkey ; Arslan, A.

We have adapted Petri nets and functional dependencies amongst objects in parallel rule languages. After this adaptation, the yielded Petri net-we will call it Relational Petri Nets (RPNs) with Start/Stop Place-is analysed in this paper. Liveness, reversibility, no conservation and boundedness in practice, consistency, strongly connected of this kind of net have been specified in this work. The properties of transitions are also analysed in this work

Published in:

Parallel and Distributed Systems: Workshops, Seventh International Conference on, 2000

Date of Conference:

Oct 2000

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.