On stability of asynchronous automata

A procedure for determining a stable (race-free) state of an asynchronous automaton is described which is applicable to many kinds of stability. A V- and a VP-stable automata are defined and designed by using an abstract asynchronous automaton.