Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Fast and memory-efficient invariant computation of ordinary Petri nets

Fast and memory-efficient invariant computation of ordinary Petri nets

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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 p1S, then there also exist k–1 invariants yi, i=2, 3,   , k, where k=|S|, such that the support of yi contains a place piS. The proposed algorithm exploits this observation by computing only y1 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.

References

    1. 1)
      • J. Cortadella , A. Kondratyev , L. Lavagno , C.P. Sotiriou . Desynchronization: synthesis of asynchronous circuits from synchronous specifications. IEEE Trans. Comput. Aided Des. , 10 , 1904 - 1921
    2. 2)
      • Borujij, A., Boutayeb, M., Koenig, D., Cecchin, T.: `On generating a basis of invariants in Petri nets', Proc. IEEE Int. Conf. on Systems, Man, and Cybernatics, 1997, p. 2228–2223.
    3. 3)
      • T. Tanida , T. Watanabe , K. Onaga . A polynomial-time algorithm for finding a semi-generator of Petri net invariants. Proc. Int. Symp. on Circuits and Systems , 2838 - 2841
    4. 4)
      • J. Martinez , M. Silva , C. Girau , W. Resisig . (1982) A simple and fast algorithm to obtain all invariants of a generalised Petri Net.
    5. 5)
      • Yamauchi, M., Wakuda, M., Taoka, S., Watanabe, T.: `A fast and space-saving algorithm for computing invariants of Petri nets', Proc. IEEE Int. Conf. on Systems, Man, and Cybernatics, 1999, p. 866–871.
    6. 6)
      • S. Taoka , K. Takano , T. Watanabe . Extracting minimal siphon-traps of Petri nets and its application to computing non-negative integer invariants. IEICE Trans. Fundam. , 11 , 2436 - 2446
    7. 7)
      • T. Murata . Petri nets: properties, analysis and application. Proc. IEEE , 4 , 541 - 580
    8. 8)
      • A. Taguchi , S. Taoka , T. Watanabe . An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants. Proc. Int. Symp. on Circuits and Systems , 172 - 175
    9. 9)
      • K. Takano , S. Taoka , M. Yamauchi , T. Watanabe . Experimental evaluation of two algorithms for computing Petri net invariants. IEICE Trans. Fundam. , 11 , 2871 - 2880
    10. 10)
      • Takano, K., Taoka, S., Yamauchi, M., Watanabe, T.: `Two efficient methods for computing Petri net invariants', Proc. IEEE Int. Conf. on Systems, Man, and Cybernatics, 2001, p. 2717–2722.
    11. 11)
      • M. D'Anna , S. Trigila . Concurrent system analysis using Petri nets: an optimized algorithm for finding net invariants. Comput. Commun. , 4 , 215 - 220
    12. 12)
      • M. Silva , J.M. Colom . (1991) Convex geometry and semiflows in P/T nets: a comparative study of algorithms for computation of minimal P-semiflows, Lectures Notes in Computer Science.
    13. 13)
      • Watson, J.F., Desrochers, A.A.: `Methods for estimating state-space size of Petri nets', Proc. Int. Conf. on Robotics and Automation, 1992, p. 1031–1036.
    14. 14)
      • Borujij, A., Boutayeb, M., Cecchin, T.: `A decentralized approach for computing invariants in large scale and interconnected Petri nets', Proc. IEEE Int. Conf. on Systems, Man, and Cybernatics, 1997, p. 1741–1746.
    15. 15)
      • Dawis, E.P., Dawis, J.F., Koo, W.P.: `Architecture of computer-based systems using dualistic Petri nets', Proc. IEEE Conf. on Systems, Man, and Cybernetics, 2001, p. 1554–1558.
    16. 16)
      • E. Park , D.M. Tilbury , P.P. Khargonekar . Modular logic controllers for machining systems: formal representation and performance analysis using Petri nets. IEEE Trans. Robot. Autom. , 6 , 1046 - 1061
    17. 17)
      • J. Farkas . Theorie der einfachen ungleichungen. J. F. d. reine Angew Math. , 1 - 27
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cdt_20060071
Loading

Related content

content/journals/10.1049/iet-cdt_20060071
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address