For the most recent entries see the Petri Nets Newsletter.

A Polynomial Algorithm for Finding the T-invariants of a Petri Net.

Orekhov, A.A.

In: Otdelenie Matematiki, Mekhaniki i Kibernetiki Akademii Nauk, Ukrainskoi SSR, Kibernetika, No. 3, pages 102-103. 1988. In Russian.

Abstract: A polynomial algorithm based on the successive solution of a number of LP problems is presented for the problem of finding a maximal linearly independent set of the Petri net T-invariants.

Keywords: T-invariant, (maximal linearly independent set).

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography