hybrid automaton
Modeling and Control of Equipment Leasing System Based on Hybrid Automaton
... system hybrid automata model. Hybrid Automata Model maximum error between the measured values and the real is ...the hybrid automata are under control, the system will keep the rental ...
6
A Geometric Method for Generating Discrete Trace Transition System of a Polyhedral Invariant Hybrid Automaton
... of hybrid systems need to have complete information about the discrete states transitions of the underling ...the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and ...
10
Mechanical Equivalents to Hybrid Automata.
... For a hybrid automaton, time Γ consists of a nonempty, left-closed, fully-ordered set, with some ordering relation ≤, that is closed under addition. I refer to any particular value in Γ as an instant, ...
336
Robust semi-explicit model predictive control for hybrid automata
... 6. CPU PROCESSING CONTROL In this section, the above results are applied on the CPU processing control problem (Azuma and Imura, 2003). In order to realize the high-speed and energy-saving computing more effectively, we ...
6
Non-blocking supervisory control for initialised rectangular automata
... of hybrid automata for which the controller synthesis procedure ...the hybrid automaton can be partitioned into a finite number of bisimulation classes (see [3, ...timed automaton (see [1]), ...
13
On weighted time optimal control for linear hybrid automata using quantifier elimination
... for hybrid systems is the hybrid automaton, which represents discrete com- ponents by finite-state machines and continu- ous components by real-numbered ...of hybrid systems is the so called ...
6
Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
... The present paper is extended to fuzzy 2-local ω-languages to fuzzy n-local ω-languages and B¨ uchi fuzzy 2-local ω-languages to B¨ uchi fuzzy n-local ω- languages and we also establish the relationship between ...
11
Indexing Ordered Trees for (Nonlinear) Tree Pattern Matching by Pushdown Automata
... pushdown automaton (PDA) is an appro- priate model of computation for labelled ordered trees in linear notation and that the trees in postfix notation acceptable by deterministic PDA form a proper su- perclass of ...
30
Fuzzy $\omega$-Tree Automata
... tree automaton is also recognized by a fuzzy Muller tree ...tree automaton is also recognized by a fuzzy Muller tree automaton and ...tree automaton if and only if it is ...
6
Timed Watson-Crick Online Tessellation Automaton
... Abstract. Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. We define Watson-Crick online tessellation automata which work on double-stranded ...
8
The word problem in Hanoi Towers groups
... of automaton groups is unknown. For contracting automaton groups the word problem is solvable in polynomial time [8, Proposition ...the automaton group is free, nilpotent, ...
8
Geometric Representations of Interacting Maps
... Let us describe the BBS map T by an interaction of a family of interval maps. The basic method will take two steps. Firstly we will describe it by a proper Mealy automaton, and then we write down the ...
48
Volume 41: Graph Transformation and Visual Modeling Techniques 2011
... Recently automaton functors were proposed as acceptors of recognizable graph ...Since automaton functors may contain an infinite number of finite state sets, one must restrict to finitely representable ones ...
13
Reasoning About the Correctness of Sanitizers
... All processes had a time-out set to 30 minutes. If no model was found within this time, then the learning process was terminated. The input characters have been cho- sen from the range 1 to 400 which refer to the decimal ...
81
Automorphism Group of an Inverse Fuzzy Automaton
... An automaton is a model of a sequential switching circuit with a finite number of states,with state changing when it is subjected to an input ...an automaton and its input semigroup, outputs are not ...
7
Cellular-automaton decoders for topological quantum memories
... The ϕ -automaton carries information about distant anyons through local update rules. As has already been hinted at in the previous section, information takes time to propagate through the fi eld, and the most ...
8
Modelling the effects of bacterial cell state and spatial location on tuberculosis treatment : insights from a hybrid multiscale cellular automaton model
... a hybrid, individual-based approach that analyses spatio-temporal dynamics at the cel- lular level, linking the behaviour of individual bacteria and host cells with the macroscopic behaviour of the ...cellular ...
14
Cellular automaton modeling of semisolid microstructure formation
... cellular automaton (mCA) model has been developed, which is coupled with macroscopic models for heat transfer calculation and microscopic models for nucleation and grain ...
6
Incremental Construction and Maintenance of Minimal Finite State Automata
... finite-state automaton will be called complete (Revuz ...finite-state automaton may be made complete by adding a new absorption state ⊥ to Q, so that all undefined transitions point to it and δ( ⊥, a) = ⊥ ...
10
Computation with competing patterns in life like automaton
... cellular automaton rule B2/S2345 where a cell in state ‘0’ takes state ‘1’ if it has exactly two neighbors in state ‘1’ and the cell remains in the state ‘1’ if it has between two and five neighbors in state ...
28