Abstract:
The paper describes an algebra of asynchronous events obtained by applying the unification, fitting, concutenation and iteration to letters of a specified alphabet a finite number of times. The tools of graphs of operations intended for description of the behaviour of asynchronous discrete-time units, where elements of that algebra are used, is described. Deterministic and nondeterministic graphs of operations are described and correspondence between graphs of operations and finite automata is treated.