19828 Christian Bohr: Komplexitätstheorie und Polynomideale II.
Internet 1998, 7p.

18742 Olga Caprotti/Alois Ferscha/Hoon Hong: Reachability test in Petri
nets by Gröbner bases. RISC Linz 1995, 16p.

18779 Angie Chandler/Anne Heyworth: Gröbner basis procedures for testing
Petri nets. Internet 2007, 13p.

18834 Angie Chandler/Anne Heyworth/Lynne Blair/Derek Seward: Testing
Petri nets for mobile robots using Gröbner bases.
Internet 2000, 13p.

Massimiliano Dessi': Reti di Petri e basi di Gröbner.
Tesi Univ. Pisa 2007.

18865 Roxana Dietze/Manfred Kudlek/Olaf Kummer: On decidability problems
of a basic class of object nets. Internet 2006, 9p.

18879 Johan Gunnarsson: Symbolic methods and tools for discrete
event dynamic systems. Thesis Linköping Univ. 1997, 264p.

19829 Anne Heyworth: Applications of rewriting systems and Gröbner bases
to computing Kan extensions and identities among relations.
PhD thesis Univ. Wales Bangor 1998, 84p.

18788 Ulla Koppenhagen/Ernst Mayr: An optimal algorithm for constructing
the reduced Gröbner basis of binomial ideals, and applications to
commutative semigroups. J. Symb. Comp. 31 (2001), 259-276.

18785 Ernst Mayr: On polynomial ideals, their complexity, and applications.
TU München TUM-I9520 (1995), 16p.

18876 Christoph Schneider/Joachim Wehler: Commutative algebra applied
to net theory. Internet 1998, 7p.

18882 Christoph Schneider/Joachim Wehler: Potential reachibility in
commutative nets. Internet 1999, 7p.