Sciweavers

665 search results - page 41 / 133
» The Theory of Hybrid Automata
Sort
View
TNN
2010
139views Management» more  TNN 2010»
13 years 3 months ago
Identification of finite state automata with a class of recurrent neural networks
A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The application of the proposed network is addressed in...
Sung Hwan Won, Iickho Song, Sun-Young Lee, Cheol H...
ICALP
2005
Springer
14 years 2 months ago
Decidability and Complexity Results for Timed Automata via Channel Machines
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
CONCUR
2010
Springer
13 years 9 months ago
Learning I/O Automata
Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy ...
Fides Aarts, Frits W. Vaandrager
TSMC
2002
156views more  TSMC 2002»
13 years 8 months ago
Varieties of learning automata: an overview
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...
M. A. L. Thathachar, P. Shanti Sastry
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
14 years 3 months ago
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
Jens Oehlerking, Oliver E. Theel