4 research outputs found

    Selected Topics in Asynchronous Automata

    Full text link
    The paper is concerned with defining the electrical signals and their models. The delays are discussed, the asynchronous automata - which are the models of the asynchronous circuits - and the examples of the clock generator and of the R-S latch are given. We write the equations of the asynchronous automata, which combine the pure delay model and the inertial delay model; the simple gate model and the complex gate model; the fixed, bounded and unbounded delay model. We give the solutions of these equations, which are written on R->{0,1} functions, where R is the time set. The connection between the real time and the discrete time is discussed. The stability, the fundamental mode of operation, the combinational automata, the semi-modularity are defined and characterized. Some connections are suggested with the linear time and the branching time temporal logic of the propositions

    Towards a Mathematical Theory of the Delays of the Asynchronous Circuits

    Full text link
    The inequations of the delays of the asynchronous circuits are written, by making use of pseudo-Boolean differential calculus. We consider these efforts to be a possible starting point in the semi-formalized reconstruction of the digital electrical engineering (which is a non-formalized theory)

    Real Time Models of the Asynchronous Circuits: The Delay Theory

    Full text link
    The chapter from the book introduces the delay theory, whose purpose is the modeling of the asynchronous circuits from digital electrical engineering with ordinary and differential pseudo-boolean equations.Comment: 82 pages, 30 figure

    Selected Topics in Asynchronous Automata

    No full text
    The paper is concerned with the modeling of the electrical signals and of the asynchronous circuits by R->{0,1} functions and asynchronous automata. The equations of the asynchronous automata are written and solved; the stability, the fundamental mode of operation, the technical condition of good running and some aspects of semantics of the propositional temporal logic as seen from behind asynchronous automata are presented
    corecore