2010
DOI: 10.1007/s10958-010-0058-z
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and synthesis of abstract automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…The formal basis of recognition in the control model for external (3)partially observable and controlled behavior is check or recognizing experiments [11], which make it possible to determine the correspondence of the checked EPN S(f)^ and the reference EPN S(f).…”
Section: Development Of a Model Of Testing With Verification Of Energy Inputsmentioning
confidence: 99%
See 2 more Smart Citations
“…The formal basis of recognition in the control model for external (3)partially observable and controlled behavior is check or recognizing experiments [11], which make it possible to determine the correspondence of the checked EPN S(f)^ and the reference EPN S(f).…”
Section: Development Of a Model Of Testing With Verification Of Energy Inputsmentioning
confidence: 99%
“…As a result, it becomes possible to construct control or recognition experiments [11] to testing the complete behavior (2) of non-redundant EPN S(f) provided that internal elements are determined and recognizedsubsets of positions with internal events from Ev\X or transitions with internal actions from Ac\Y.…”
Section: Development Of a Model Of Testing With Verification Of Energy Inputsmentioning
confidence: 99%
See 1 more Smart Citation
“…Due to a finite time of observation, collected data is necessary partial; consequently, identification is often presented as a sub-problem of net synthesis, where the whole behaviour of the system is known, as well as counterexamples. This difference is pointed out in [10]. Both problems have been treated in several works, surveyed in [4].…”
Section: A Related Workmentioning
confidence: 99%
“…Development of the models and methods for the automata theory and experiments, determining the general methodology of the behavioral test analysis, removes the upper bounds of applicability of the test automata models [13,14]. Complexity reduction, first of all, the reduction of the time of behavioral tests synthesis in a class of errors of mapping with the substantially saved values of the check completeness, is reached by:  the distributed network [15,16,17] and throughhierarchical [18] methods, reducing polynomially the dimension of the test synthesis and its duration due to the decomposition;  the evolutionary-genetic methods [19][20][21], which have the upper bounds of complexity of the determined methods and give polynomially smaller experimental values of complexity of the tests synthesis for the majority of cases [22]. Nevertheless, the synthesis of behavioral tests of the acceptable check completeness is possible for DIS with an average degree of complexity; it refers to the test of NP-complex class despite this reduction.…”
Section: Analysis Of Existing Solutionsmentioning
confidence: 99%