The modeling and control flexible-manufacturing workcells (FMCs) has generally been performed in a hierarchical structure, where at the highest level they have been modeled as dis...
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
— Parallel algorithms are presented for modules of learning automata with the objective of improving their speed of convergence without compromising accuracy. A general procedure...
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...