Experiments with automata when the upper bound of the number of their states is unknown

Grunskii, I. S.; Maksimenko, I. I.

doi:10.1007/bf02835853

Cited by 4 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider now the testing problems when a class F can be infinite but it is defined by a finite means. In this section, we study two ways of defining an infinite class, by a set Mg(xY [9,12] and by nondeterministic automata [2,21,22,24] .…”

Section: Finite-definable Classes Of Automatamentioning

confidence: 99%

See 1 more Smart Citation

Testing of automata: from experiments to representations by means of fragments

Grunsky

1998

Testing of Communicating Systems

View full text Add to dashboard Cite

This paper discusses some developments and results of the theory of test generation from automata. These developments are driven by the needs to better understand the nature of automata testing and thus to make the testing theory more applicable to real systems. We provide an overview of some important results in automata testing recently obtained in the Soviet Union and in the countries that have arisen from it. Keywords Automaton (finite state machine), testing problems, checking experiments and sequences, checking test, test complexity, experiments on automata, automata fragment 1 INTRODUCTION Automata or finite state machines have been widely used as mathematical models of discrete systems in diverse areas such as computer hardware and software and more recently, communication protocols [

show abstract

Section: Finite-definable Classes Of Automatamentioning

confidence: 99%

“…The condition of Theorem 10 can be verified by a polynomial algorithm. The polynomial condition of checking sequence existence can be found in [12] as well. Another way of defining automata classes uses a nondeterministic automaton.…”

Section: A Multiple Checking Experiments O/(af(m)=) Exists Iff Aeg(m)mentioning

confidence: 99%

Testing of automata: from experiments to representations by means of fragments

Grunsky

1998

Testing of Communicating Systems

View full text Add to dashboard Cite

show abstract

Analysis and synthesis of abstract automata

2010

View full text Add to dashboard Cite

Analysis of behaviour of automata

Kudryavtsev¹,

Grunskii²,

Kozlovskii³

2009

Discrete Mathematics and Applications

Self Cite

View full text Add to dashboard Cite

This survey contains results concerning behavioural and abstract theory of finite automata. Finite automata and related constructions are cornerstone concepts of discrete mathematics and mathematical cybernetics. The automata theory finds multiple applications in programming, technical cybernetics, theory of dynamic systems, etc. Classical problems of this theory are the direct problems: analysis of processes of transformation of information carried out by automata and properties of automata, and the inverse problems: synthesis of automata of prescribed properties and identification (restoring, recognition, deciphering, control and diagnosis) of an automaton by means of an experiment with it.The fundamental notion which underlies the study of the above problems is the notion of a fragment which is a natural extension of a great body of known fragments of particular forms possessing their characteristic properties. We introduce the fragment-automaton relation, consider properties of classes of fragments of a given automaton. We introduce the notion of a cofragment (forbidden fragment) of an automaton, consider properties of classes of automata which have a given fragmentcofragment pair. Another key notion is the notion of an identifier of unobservable components of functioning of an automaton, that is, of a fragment which allows for unambiguous determination of values of these components. It is demonstrated that identifiers provide us with a powerful tool for solving the problems we consider in this paper.Next, we introduce the general notion of representation of the reference automaton to within a given precision (similarity) relative to a priori class of automata as a pair (fragment, cofragment) of the reference automaton which can be a pair (fragment, cofragment) of an automaton in a priori class if and only if it is similar to the reference one. It is shown that this concept covers and generalises a series of particular notions (control, recognising experiments, questionnaire languages, k-sets, etc.) known in the automata theory. We suggest a natural classification of representations. We carry out a systematic study of conditions for existence and structure of representations.We obtain precise conditions for existence of representations of general form and their particular classes in terms of relations between properties of a priori class, class of automata similar to the reference one, and the class of automata indistinguishable from the reference automaton for the corresponding indistinguishability relation. We obtain conditions for existence of nontrivial representations for various classes, including questionnaire languages and control experiments.This survey contains a series of final results, but they can be treated as a regular step in studying problems of analysis and synthesis of automata by their behaviour, which are continuously filled with new content and require additional resources to solve them.

show abstract

Experiments with automata when the upper bound of the number of their states is unknown

Cited by 4 publications

References 2 publications

Testing of automata: from experiments to representations by means of fragments

Testing of automata: from experiments to representations by means of fragments

Analysis and synthesis of abstract automata

Analysis of behaviour of automata

Contact Info

Product

Resources

About