Trace Nets and Conflict-free Computations

Authors:
Edward Ochmański;Joanna Pieckowska
Affiliations:
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland Institute of Computer Science, Polish Academy of Sciences, Warszawa, Poland. E-mail: edoch@mat.uni.t ...;Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland Institute of Applied Informatics, State Higher School of Vocational Education, Elbląg, Poland. ...
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Year:
2006

Citing 3
Cited 0

Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Place or Transition Petri Nets

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Elementary Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets

Quantified Score

Hi-index	0.00

Visualization

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.