Topic
Continuous automaton
About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.
Papers published on a yearly basis
Papers
More filters
•
27 Oct 2011TL;DR: This paper introduces a subclass of hybrid automaton called a symmetric Hybrid Automaton in which the continuous dynamics for each state is given by a transformation (diffeomorphism) from a core dynamics.
Abstract: In this paper, we introduce a subclass of hybrid automaton called a symmetric hybrid automaton in which the continuous dynamics for each state is given by a transformation (diffeomorphism) from a core dynamics. Since the continuous dynamics is collapsed into the core dynamics in the symmetric hybrid automaton, we can deal with the properties of systems such as stability and reachability in the core dynamics. We focus on the discrete dynamics and the geometric properties, especially Zeno behavior, of a symmetric hybrid automaton.
••
TL;DR: A deterministic approach to the hybrid automaton is proposed, in which each state of the automaton has the differential and the control inclusions, and the state space partition (or system operating regime) is used to define the Automaton states.
••
18 Dec 2002TL;DR: This work constructs one automaton for each reservation table which acts as a compact encoding of all the conflict automata for this table, which can be recovered for use in modulo-scheduling.
Abstract: Instruction scheduling with an automaton-based resource conflict model is well-established for normal scheduling. Such models have been generalized to software pipelining in the modulo-scheduling framework. One weakness with existing methods is that a distinct automaton must be constructed for each combination of a reservation table and initiation interval. In this work, we present a different approach to model conflicts. We construct one automaton for each reservation table which acts as a compact encoding of all the conflict automata for this table, which can be recovered for use in modulo-scheduling. The basic premise of the construction is to move away from the Proebsting-Fraser model of conflict automaton to the Muller model of automaton modelling issue sequences. The latter turns out to be useful and efficient in this situation. Having constructed this automaton, we show how to improve the estimate of resource constrained initiation interval. Such a bound is always better than the average-use estimate. We show that our bound is safe: it is always lower than the true initiation interval. This use of the automaton is orthogonal to its use in modulo-scheduling. Once we generate the required information during pre-processing, we can compute the lower bound for a program without any further reference to the automaton.
••
23 Feb 2009TL;DR: It is demonstrated that the homogeneous congested flow is closely related to synchronized flow and can be regarded as solution of large system.
Abstract: This paper studies approximation solution of a cellular automaton model. In the model, the finite size effect is trivial because the congested flow is quite homogeneous. Thus, the approximation solution of a small sized system can be regarded as solution of large system. We have investigated the approximation solution of a small traffic system with two vehicles. The analytical result is in good agreement with simulation. Finally, it is demonstrated that the homogeneous congested flow is closely related to synchronized flow.
••
TL;DR: Group cellular automata generalize the concept of additive automata into non-commutative groups as mentioned in this paper , and the set of space-time diagrams of a group cellular automaton is a group shift.
Abstract: We consider subshifts and cellular automata in the setup where the state set is a finite group. The group does not need to be commutative. A subshift that is also a subgroup is called a group shift, and we call a cellular automaton on a group shift a group cellular automaton if it is also a group homomorphism. Group cellular automata generalize the much studied concept of additive cellular automata into non-commutative groups. The set of space-time diagrams of a group cellular automaton is a group shift, so we can apply classical results by Bruce Kitchens and Klaus Schmidt on group shifts to analyze group cellular automata. In particular, we can effectively construct the limit set and the trace subshifts of any group cellular automaton. We can then algorithmically decide many properties concerning the cellular automaton that are in general undecidable. The talk is based on a joint work with Pierre Béaur.KeywordsGroup cellular automataGroup shiftsSymbolic dynamicsDecidability