Technical Condition of Good Running of the Discrete Time Asynchronous Automata

Title: Technical Condition of Good Running of the Discrete Time Asynchronous Automata

Abstract: This research article explores the technical condition of good running for discrete time asynchronous automata. It defines and characterizes several properties related to this condition, including delay-insensitivity, hazard-freedom, semi-modularity, and the technical condition of good running. The study uses a formalism for asynchronous automata based on a series of papers by Anatoly Chebotarev, and it makes assumptions about the delays of the asynchronous circuits. The main findings of the research are that the delays are unknown, unbounded, and not constant, and that the technical condition of good running is an important safety property for these automata.

Main Research Question: What are the technical conditions for good running of discrete time asynchronous automata, and how can these conditions be characterized and verified?

Methodology: The study uses a formalism for asynchronous automata to define and characterize the technical condition of good running. It makes assumptions about the delays of the asynchronous circuits and uses binary sequences, monotonous sequences, and convergent sequences to describe the behavior of the automata. The research also presents a series of properties related to this condition, including delay-insensitivity, hazard-freedom, and semi-modularity.

Results: The research identifies and characterizes the technical condition of good running for discrete time asynchronous automata. It shows that this condition is related to the existence of certain transitions and the absence of unpredictable behavior. The study also presents a series of properties that are related to this condition, including delay-insensitivity, hazard-freedom, and semi-modularity.

Implications: The technical condition of good running is an important safety property for discrete time asynchronous automata. The research provides a formalism for characterizing this condition and presents a series of properties that can be used to verify the good running of these automata. This work contributes to the understanding and development of asynchronous automata and their applications in various fields, such as computer science and electrical engineering.

Link to Article: https://arxiv.org/abs/0110062v1 Authors: arXiv ID: 0110062v1