Determinization of logical specifications of automata
The present article is a continuation of a series of studies on functional synthesis of automata from their logical specifications. A specification language L based on the logic of one-place predicates interpreted on the set of integers has been described. A specification S in this language defines the class K(S) of equivalent nondeterministic automata. If S is treated as a specification of deterministic automata, then the class of all automata satisfying the specification S is identical with the class of all determinizations of any automaton from K(S). The problem of functional synthesis of a deterministic automaton specified in the language L involves constructing a procedural representation of the automaton (i.e., a representation in terms of states and transition and output functions) that satisfies the original specification. It thus includes the construction of one or several determinizations of an automaton from the class K(S). The last problem can be solved either on the procedural level (i.e., the level of the automaton graph) by constructing a procedural representation of an automation from K(S) or on the logical level (i.e., the level of formulas in the language L). In this article, we propose a solution of the problem based on the methodology of verification design of automaton. An essential feature of this methodology is that all transformations of the automaton being designed (except the construction of a procedural representation of the automaton) are carried out on the level of specification language formulas. This permits using logic methods to verify the correctness of the applied by the designer in the process of design. The problem is accordingly formulated as follows: given the specification S, constructed a specification S such that K(S{sup *}) is a class of equivalent deterministic automata that are determinizations of automata from K(S).
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 457565
- Journal Information:
- Cybernetics and Systems Analysis, Journal Name: Cybernetics and Systems Analysis Journal Issue: 1 Vol. 31; ISSN CYASEC; ISSN 1060-0396
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the applications of multiplicity automata in learning
Automation synthesis from a nonformal specification