Conception of discrete systems decomposition algorithm using p-invariants and hypergraphs

Abstract. In the article author presents the idea of decomposition algorithm of discrete systems described by Petri Nets using p-invariants. Decomposition process is significant from the point of view of discrete systems design, because it allows separation of the smaller sequential parts. Proposed algorithm uses modified Martinez-Silva method as well as author’s selection algorithm. The developed method is a good complement of classical decomposition algorithms using graphs and hypergrahs.

Author: Łukasz Stefanowicz
Conference: Title