Abstract
A simple (finite automata) model for parallel computation is considered. The parallelism is replaced by nondeterminism. The class of all parallel realizations of given processes is algebraically characterized, and a natural “less parallel” gelation between realizations is introduced. A sufficient and necessary condition is riven for the existence of the maximally parallel realization in the set of correct lealizations (distinguished by means of computational invariants).
Get full access to this article
View all access options for this article.