An efficient algorithm for finding all maximal conflict sets in concurrent programs

Conflict is one of the fundamental situations that appear in concurrent programs. Conflict occurs when more than one processes share common resources. An occurrence of the action of one process disables actions of other processes which are in conflict. Controlling conflicts is very important in concurrent programming, especially for rule-based programming. We can find all conflicts by generating the state space, but largeness of the state space make this difficult. In this paper, we show an efficient algorithm to find all maximal conflict sets in concurrent programs. The proposed algorithm is based on partial order methods, and generates a reduced state space that preserves all maximal conflict sets