In: Theoretical Computer Science Vol. 153, No. 1--2, pages 271-300. 1996.
Abstract: Equal conflict net systems are a weighted generalization of the (extended) free choice subclass that keeps the total autonomy of choices. A substantial part of the analytical branch of the structure theory of free choice systems, including decomposition and duality, the rank theorem, characterizations of impartial sequences and prompt interfaces, and the existence of home states, is extended to the equal conflict case. In so doing, several familiar concepts and objects from the structure theory of place/transition net systems are revisited from a linear algebraic perspective, which is specially adequate to cope with weighted nets.