|
Edward Ochmański
On conflict-free executions of elementary nets
921
Abstract
The paper deals with analysis of elementary Petri nets with respect to possibilities of avoiding conflicts during their executions. In concurrent systems, unlike to the sequential ones, avoiding of potential conflicts is not impossible. The basic notion of the paper is the notion of fairness, in sequential (fair run) and concurrent (fair process) versions. Main results:
- The proof of decidability, for elementary nets, of the problem existence of a
conflict-avoidable fair process (and an algorithm producing all fair runs) and
- Construction, for arbitrary given elementary net, a conflict-avoidable net with the same behaviour.
Key words:
concurrency, traces, fairness, Petri nets.
|
|
 |
 |
