Conference paper

Minimization of SM-Covers of Petri Net Specifications of Control Systems

A. Karatkevich (AGH Univ. of Science and Techn., Poland), Ł. Stefanowicz (Univ. Zielona Gora, Poland)

Some methods of implementation of the concurrent systems require obtaining their cover with the sequential processes. There exists a range of algorithms generating such covers which may be redundant. The paper deals with this kind of redundancy in the context of Petri nets. The following task is considered: a Petri net is given, and a set of State Machine subnets covering the net; its minimum subset covering the Petri net has to be obtained. The task is solved using the hypergraph representation of the system. It is shown that in many cases the exact minimization can be obtained in polynomial time.

Download one page abstract

Receipt of papers:

February 29th, 2020

Notification of acceptance:

April 25th, 2020

Registration opening:

April 30th, 2020

Final paper versions:

May 15th, 2020