Edward Ochmanski

Petri nets with weak conflicts: a proposal of a classification

866

Abstract

The paper deals with theoretical aspects of some practical problems about petrinets: how to avoid conflicts and when is it possible? We are studying the class of petrinets, which can be implemented without an external conflict resolving supervisor. Such nets are named weakly conflicting, and conflicts appearing in them are said to be weak. We investigate properties of nets, with respect to conflicts, and propose a classification of them. Then we prove the proposed classes of nets form a partially ordered hierarchy.

Key words: Petri nets, concurrency, conflicts, semi-commutation, partial words.