Automation synthesis from a nonformal specification
The fundamental possibility of developing universal approaches to the synthesis of finite automata from a nonformal specification requires the introduction of heuristic elements into the synthesis procedure. Various examples of using one of such approaches for the synthesis of asynchronous automata are given elsewhere. The approach on the whole is nondeterministic, which leads to application difficulties. In this paper, we propose a universal technique for the determination of the state set of the automaton being synthesized (synchronous or asynchronous) directly from the initial description. Compared with previous techniques, the heuristic region is smaller and the heuristics is substantively clearer. Further synthesis follows a completely deterministic process. The approach is intended for the design of universal interactive abstract synthesis subsystems. The division of automata into synchronous and asynchronous acquires a special meaning when the initial specification includes an option for choosing a particular type of automaton. If an alternative is available and the reliability requirements are fairly stringent, the asynchronous variant may be preferable. The notion of asynchronous automaton is not linked with the implementation method. The device itself may be synchronous or asynchronous.
- OSTI ID:
- 457588
- Journal Information:
- Cybernetics and Systems Analysis, Vol. 30, Issue 4; Other Information: PBD: Mar 1995; TN: Translated from Kibernetika i Sistemnyi Analiz; No. 4, 29-41(Jul-Aug 1994)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Consistency test for simple specifications of automation systems
Data-flow graphs as a model of parallel complexity