Affiliations: Faculty of Mathematics and Computer Science, Nicolaus
Copernicus University, Toruń, Poland Institute of Computer Science,
Polish Academy of Sciences, Warszawa, Poland. E-mail:
[email protected] | Faculty of Mathematics and Computer Science, Nicolaus
Copernicus University, Toruń, Poland Institute of Applied Informatics,
State Higher School of Vocational Education, Elbl�g, Poland. E-mail:
[email protected]
Abstract: Trace nets are a generalization of elementary nets, proposed by
Badouel and Darondeau. They admit phenomena, unknown in traditional nets. For
instance, in trace nets does not hold the "diamond property". For this reason,
we propose a more precise definition of conflict, applicable to trace nets, and
study occurrences of conflicts and existence of conflict-free runs in such
nets. Main result of the paper says that any just computation in a trace net,
starting from a conflict state, contains a conflict step. This result allows to
construct an algorithm, selecting only conflict-free just computations from
among all computations of a given net. All results of the paper hold for
elementary nets, as they are a subclass of trace nets.
