Proving nonreachability by modulo-invariants

Theoretical Computer Science

Volumn 153, Issue 1-2, 1996, Pages 49-64

  Desel, J ^a   Neuendorf, K P ^b   Radola, M D ^c  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INTEGRAL EQUATIONS; INVARIANCE; SYSTEM THEORY; VECTORS;

FINITE SET; INTEGER; MARKING EQUATION; MODULO INVARIANTS; NONREACHABILITY; PLACE INVARIANTS; WEIGHTED SUM;

PETRI NETS;

EID: 0030574533     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00117-4     Document Type: Article

References (14)

1. G. W. Brams, Réseaux de Pétri: Théorie et Pratique, Tome 1 (Masson, Paris, 1983).
2. E. Cardoza, R. Lipton and R. Meyer, Exponential space complete problems for Petri nets and commutative semigroups, in: Proc. 8th ACM Symp. in Theory of Computing - IEEE (1976) 50-54.
3. P.M. Cohn, Algebra, Vol. 1 (Wiley, London, 1974).
4. J. Desel and J. Esparza, Reachability in cyclic extended free-choice systems, Theoret. Comput. Sci. 114 (1993) 93-118.
5. M.R. Garey and P.S. Johnson, Computers and intractability A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).
6. M. Jantzen, Complexity of place/transition nets, in: W. Brauer, W. Reisig, G. Rozenberg, eds., Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part I, Lecture Notes in Computer Science, Vol. 254 (Springer, Berlin, 1987) 413-434.
7. K. Jensen and G. Rozenberg, eds., High-level Petri Nets (Springer, Berlin, 1991).
8. R. Kannan and A. Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput. 8 (1979) 499-507.
9. W. Kluge and K. Lautenbach, The orderly resolution of memory access conflicts among competing channel processes, IEEE Trans. Comput. C-31 (3) (1982) 194-207.
10. K. Lautenbach, Liveness in Petri nets, Internal Report GMD-ISF 72-02.1, Gesellschaft für Mathematik und Datenverarbeitung, Bonn, 1972.
11. E.W. Mayr, An algorithm for the general Petri net reachability problem, SIAM J. Comput. 13 (1984) 441-460.
12. K.-H. Pascoletti, Diophantische Systeme und Lösungsmethoden zur Bestimmung aller Invarianten in Petri-Netzen, GMD-Bericht Nr. 160 (Oldenbourg, Munich, 1986).
13. M. Pohst and H. Zassenhaus, Algorithmic Algebraic Number Theory (Cambridge Univ. Press, Cambridge, 1989).
14. W. Reisig, Petri Nets - An Introduction, EATCS Monographs on Theoretical Computer Science, Vol. 4 (Springer, Berlin, 1985).