By Topic

Fast and memory-efficient invariant computation 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
$33 $33
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)
C. -f. Law ; Nanyang Technol. Univ., Singapore ; B. -h. Gwee ; J. S. Chang

An efficient implementation of the Fourier-Motzkin (FM) algorithm for computing all non-negative, minimal-support invariants of ordinary Petri nets is proposed. The proposed algorithm is inspired by the observation that for a set S of parallel places (i.e. places that have the same input and output transitions, and the same corresponding arc weights), if there exists an invariant y1 whose support contains p1 isin S, then there also exist k-1 invariants yi , i = 2, 3, ... , k, where k = |S|, such that the support of yi contains a place pi G S. The proposed algorithm exploits this observation by computing only yi and then generating the other corresponding invariants through a proposed enumerative process. The tests indicate that on an average, the proposed algorithm is at least 2.2 times faster in execution, and requires at least 1.8 times less memory than other comparable algorithms.

Published in:

IET Computers & Digital Techniques  (Volume:1 ,  Issue: 5 )