Consistency test for simple specifications of automation systems
This article continues the topic of functional synthesis of automaton systems for discrete-information processing. A language of functional specification of automaton systems based on the logic of one-place predicates of an integer argument has been described. A specification in this language defines a nondeterministic superword X-Y-function, i.e., a function that maps superwords in the alphabet X into sets of superwords in the alphabet Y (the alphabets X and Y are specification-dependent), which corresponds to an initialized nondeterministic X-Y-automaton. The specification G is consistent if the function defined by the specification corresponds to an automaton A{sub G} with a nonempty state set. Consistency tests for the initial specification and for various intermediate specifications obtained in the process of functional synthesis of the automaton system are of fundamental importance for the verificational method of automaton system design developed in the framework of the proposed topic. We need sufficiently efficient algorithms to test consistency of specifications. An algorithm proposal constructs the coresponding automaton A{sub G} for any simple specifications G. The consistency of a specification is thus decided constructively. However, this solution is not always convenient, because it usually involves a highly time-consuming procedure to construct a nondeterministic automaton with a very large number of states. In this paper, we propose a convenient approach that combines automaton and logic methods and established consistency or inconsistency of a specification without constructing the corresponding autmaton.
- OSTI ID:
- 441161
- Journal Information:
- Cybernetics and Systems Analysis, Journal Name: Cybernetics and Systems Analysis Journal Issue: 3 Vol. 30; ISSN CYASEC; ISSN 1060-0396
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Note on the Proper ties of the Supremal Controllable Sublanguage in Pushdown Systems.
Generalized information-lossless automata of finite order. II