Experimental evaluation of two algorithms for computing Petri net invariants

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E84-A, Issue 11, 2001, Pages 2871-2880

  Takano, Katsushi ^a   Taoka, Satoshi ^a   Yamauchi, Masahiro ^b   Waanabe, Toshimasa ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

^b KINKI UNIVERSITY   (Japan)

Author keywords

Fourier Motzkin method; Memory overflow; Minimal siphon traps; Petri nets

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; GRAPH THEORY; MATRIX ALGEBRA; PETRI NETS; VECTORS;

BIPARTITE DIGRAPH; FOURIER-MOTZKIN METHOD; MEMORY OVERFLOW; MINIMAL SIPHON TRAPS;

ALGORITHMS;

EID: 0035518167     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Petri nets: Properties, analysis and applications
2. Basic properties of Petri net invariants and their computation
3. A simple and fast algorithm to obtain all invariants of a generalized Petri net
4. Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows
5. A new methodology for analyzing distributed systems modeled by Petri nets
6. Finding minimal siphons in general Petri nets
7. Computing Petri net invariants based on siphon-trap support
8. A fast and space-saving algorithm for computing invariants of Petri nets
9. A fast and space-saving algorithm FMSN for computing Petri net invariants with supports containing all specified nodes
10. Two efficient method for computing Petri net invariants