A partial language can describe the concurrent behavior of condition/event nets (C/E nets) correctly. The authors have studied the construction problem for C/E nets with the specification described by a partial language. This problem can be solved by finding all atoms compatible with the specified partial language. An atom compatible with a partial language
X is a C/E net with one condition and a set of events,
Tn, which generates the partial language restricted to
Tn, X/Tn. The paper first shows that an atom compatible with
X can be extracted from a D-clique of
X. It next proposes an algorithm for finding all atoms compatible with
X.
抄録全体を表示