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

Optimized Algorithm for Computing Invariants of Ordinary 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
$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

3 Author(s)
Chong-Fatt Law ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ. ; Bah-Hwee Gwee ; Chang, Joseph S.

We propose an optimized implementation of the Fourier-Motzkin (FM) algorithm for computing all nonnegative, minimal-support invariants of ordinary Petri nets. The FM algorithm is optimized by detecting the parallel place sets created during each of its iteration, and retaining just one member of each set while deleting the rest. The intermediate invariants obtained are then used to generate all minimal-support invariants using an optimized invariant generation process. Experimental results indicate that the proposed algorithm is at least 2.2X faster in execution and requires at least 1.8x less memory than other comparable algorithms

Published in:

Computer and Information Science, 2006 and 2006 1st IEEE/ACIS International Workshop on Component-Based Software Engineering, Software Architecture and Reuse. ICIS-COMSAR 2006. 5th IEEE/ACIS International Conference on

Date of Conference:

10-12 July 2006

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.