since 07 November 2024 :

View(s) :

1 (0 ULiège)

Download(s) :

0 (0 ULiège)

References
Facsimile [PDF, 3.6M]

About Models of Automats at Organization Fault-Tolerant Computing Processes

Alexander A. Sytnik and Claudia P. Vakhlaeva

p. 127-134

    Abstract

    A problem of synthesis of fault - tolerant computing systems which mathematical model is the deterministic finite automata is considered. The novelty in this paper is construnction of the object called as a bundle of automats whose operation is based on constant alternation of function of automats which are his components. It is shown that model of a bundle of automats at a design phase of discrete systems with memory may be used to proceed in operational period to signals generation corresponding to the required algorithm of functioning in enumerating form.

    Index

    Keywords

    automata with generalized temporal characteristics, bundle of automats, enumerator, fault tolerance, universal automata

    Text

    Download Facsimile [PDF, 3.6M]

    References

    Bibliographical reference

    Alexander A. Sytnik and Claudia P. Vakhlaeva, « About Models of Automats at Organization Fault-Tolerant Computing Processes », CASYS, 18 | 2006, 127-134.

    Electronic reference

    Alexander A. Sytnik and Claudia P. Vakhlaeva, « About Models of Automats at Organization Fault-Tolerant Computing Processes », CASYS [Online], 18 | 2006, Online since 30 July 2024, connection on 27 December 2024. URL : http://popups.uliege.be/3041-539x/index.php?id=2246

    Authors

    Alexander A. Sytnik

    Saratov State Socio-Economic University, Radischeva str., 89, 410000, Saratov, Russia

    By this author

    Claudia P. Vakhlaeva

    Saratov State Socio-Economic University, Radischeva str., 89, 410000, Saratov, Russia

    Copyright

    CC BY-SA 4.0 Deed