English
Related papers

Related papers: Selected Topics in Asynchronous Automata

200 papers

The paper presents the differential equations that characterize an asynchronous automaton and gives their solution x:R->{0,1}x...x{0,1}. Remarks are made on the connection between the continuous time and the discrete time of the approach.…

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

We define the delays of a circuit, as well as the properties of determinism, order, time invariance, constancy, symmetry and the serial connection.

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

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.

General Literature · Computer Science 2007-05-23 Serban E. Vlad

We define the delays of a circuit, as well as the properties of determinism, order, time invariance, constancy, symmetry and the serial connection.

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

In the paper we define and characterize the asynchronous systems from the point of view of their autonomy, determinism, order, non-anticipation, time invariance, symmetry, stability and other important properties. The study is inspired by…

Hardware Architecture · Computer Science 2014-11-17 Serban E. Vlad

The paper studies some important properties of the asynchronous (=timed) automata: the delay-insensitivity, the hazard-freedom, the semi-modularity and the technical condition of good running. Time is discrete.

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

The asynchronous systems are the non-deterministic models of the asynchronous circuits from the digital electrical engineering. In the autonomous version, such a system is a set of functions x:R{\to}{0,1}^{n} called states (R is the time…

Other Computer Science · Computer Science 2013-07-23 Serban E. Vlad

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…

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asynchronous automata are introduced here. It is proved that the Petri nets and transition systems with independence…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-03-15 Ahmet A. Husainov , Ekaterina S. Kudryashova

A syntactic model is presented for the specification of finite-state synchronous digital logic systems with complex input/output interfaces, which control the flow of data between opaque computational elements, and for the composition of…

Logic in Computer Science · Computer Science 2023-02-02 Nick Mertin , K. Ritsuka , Karen Rudie

Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Anaël Grandjean , Gaétan Richard , Véronique Terrier

The asynchronous systems $f$ are the models of the asynchronous circuits from digital electrical engineering. They are multi-valued functions that associate to each input $u:\mathbf{R}\to \{0,1\}^{m}$ a set of states $x\in f(u),$ where…

General Literature · Computer Science 2007-05-23 Serban E. Vlad

Time-delay systems are an important class of dynamical systems that provide a solid mathematical framework to deal with many application domains of interest. In this paper we focus on nonlinear control systems with unknown and time-varying…

Optimization and Control · Mathematics 2011-12-13 Giordano Pola , Pierdomenico Pepe , Maria Domenica Di Benedetto

The asynchronous systems are non-deterministic real time, binary valued models of the asynchronous circuits from electronics. Autonomy means that there is no input and regularity means analogies with the (real) dynamical systems. We…

Other Computer Science · Computer Science 2010-12-30 Serban E. Vlad

We study two coupled discrete-time equations with different (asynchronous) periodic time scales. The coupling is of the type sample and hold, i.e., the state of each equation is sampled at its update times and held until it is read as an…

Dynamical Systems · Mathematics 2019-07-04 Stefan Siegmund , Petr Stehlik

We establish the equivalence between a class of asynchronous distributed automata and a small fragment of least fixpoint logic, when restricted to finite directed graphs. More specifically, the logic we consider is (a variant of) the…

Formal Languages and Automata Theory · Computer Science 2018-05-18 Fabian Reiter

We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…

Dynamical Systems · Mathematics 2011-10-20 Guillon Pierre , Richard Gaétan

This paper is a survey of extensions to finite automata theory to model real-time systems as well as systems exhibiting mixed discrete-continuous behavior. Real-time systems maintain a continuous and timely interaction with the environment,…

Formal Languages and Automata Theory · Computer Science 2018-11-27 Lakhan Shiva Kamireddy

The asynchronous systems are the non-deterministic real time-binary models of the asynchronous circuits from electrical engineering. Autonomy means that the circuits and their models have no input. Regularity means analogies with the…

Other Computer Science · Computer Science 2015-03-17 Serban E. Vlad

We present a new and powerful class of automata which are explicitly concurrent and allow a very simple definition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time…

Formal Languages and Automata Theory · Computer Science 2014-11-25 Radu Grosu , Bernhard Rumpe
‹ Prev 1 2 3 10 Next ›