In: Proceedings of the 10th International Conference on Application and Theory of Petri Nets, 1989, Bonn, Germany, pages 96-114. 1989.
Also: Universidad de Zaragoza, departamento de ingenieria electrica e informatica, Research Report 89-04, January 1989.
Also in: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 483; Advances in Petri Nets 1990, pages 146-164. Berlin, Germany: Springer-Verlag, 1991.
Abstract: Commutative nets are a subclass of colored nets whose color functions belong to a ring of commutative diagonalizable endomorphisms. Although their ability to describe models is smaller than that of colored nets, they can handle a broad range of concurrent systems. Commutative nets include net subclasses such as regular homogeneous nets and ordered nets. Mathematical properties of the color functions of commutative nets allow a symbolic computation of a family of generators of flows. The method proposed decreases the number of non-null elements in a given color function matrix, without adding new columns. By iteration, the entire matrix is annulled.
Keywords: linear invariant (in) commutative high-level net; coloured net; diagonalizable endomorphisms; regular homogeneous net; ordered net; symbolic computation (of) flow generators.
Back to the Petri Nets Bibliography