Abstract
A problem of race-free state assignment of asynchronous parallel automata is considered. The goal is to encode partial states of parallel automaton using minimal number of coding variables and excluding critical races during automaton operation. Requirements imposing on the partial states codes to eliminate the in-fluence of races are formulated. An exact algorithm to find a minimal solution of the problem of race-free state assignment for parallel automata is suggested. The algorithm provides reducing the computational efforts when searching for state encoding.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Adamski, M. Wegrzyn, Field programmable implementation of current state machine. In: Proceedings of the Third International Conference on Computer-Aided Design of Discrete Devises (CAD DD’99), Vol. 1. Institute of Engineering Cybernetics of the of Belarus Academy of Sciences, Minsk, 4–12 (1999).
L.D. Cheremisinova, Implementation of parallel digital control algorithms by asynchronous automata. Automatic Control and Computer Sciences, 19(2), 78–83 (1985).
L.D. Cheremisinova, Race-free state assignment of a parallel asynchronous automaton. Upravlyajushchie Sistemy i Mashiny, 2 51–54 (1987) (in Russian).
L.D. Cheremisinova, PLC implementation of concurrent control algorithms. In: Proceedings of the International Workshop “Discrete Optimization Methods in Scheduling and Computer-Aided Design”. Republic of Belarus, Minsk, pp. 190–196 Sept. 5–6 (2000).
Yu.V. Pottosin, State assignment of asynchronous parallel automata with codes of minimum length. In: Proceedings of the International Workshop “Discrete Optimization Methods in Scheduling and Computer-Aided Design”. Republic of Belarus, Minsk, pp. 202–206 Sept. 5–6 (2000).
S.H. Unger, Asynchronous Sequential Switching Circuits. Wiley-Interscience, New York (1969).
A.D. Zakrevskij, Logical Synthesis of Cascade Networks. Nauka, Moscow (1981) (in Russian).
A.D. Zakrevskij, Parallel automaton. Doklady AN BSSR, 28(8), 717–719 (1984) (in Russian).
A.D. Zakrevskij, Parallel Algorithms for Logical Control. Institute of Engineering Cybernetics of NAS of Belarus, Minsk (1999) (in Russian).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Cheremisinova, L. (2005). Optimal State Assignment of Asynchronous Parallel Automata. In: Design of Embedded Control Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-28327-7_11
Download citation
DOI: https://doi.org/10.1007/0-387-28327-7_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23630-8
Online ISBN: 978-0-387-28327-2
eBook Packages: EngineeringEngineering (R0)