نتایج جستجو برای: fix learning automata

تعداد نتایج: 633355  

Journal: :Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications 1995

Journal: :IEEE Transactions on Cybernetics 2015

2003
HAMID BEIGY

Received 17 Revised Cellular learning automata is a combination of learning automata and cellular automata. 19 This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning 21 automata which can interact together. In some applications such as image processing, a type of cellular learn...

Journal: :IEEE Transactions on Systems, Man, and Cybernetics 1974

2011
Gilles Geeraerts Jean-François Raskin Nathalie Sznajder

Event clock automata (ECA) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properties (for instance, ECA are determinizable while timed automata are not). In this paper, we revisit and extend the theory of ECA. We first prove that no finite time abstract language equivalence exists for ECA, thereby ...

Journal: :Lecture Notes in Computer Science 2023

Abstract We present algorithms for model checking and controller synthesis of timed automata, seeing a automaton as parallel composition large finite-state machine relatively smaller automaton, using compositional reasoning on this composition. use automata learning to learn finite approximations the component, in order reduce problem at hand or synthesis. an experimental evaluation our approach.

Journal: :IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 2010

2017
Gerco van Heerdt Matteo Sammartino Alexandra Silva

Automata learning is a technique that has successfully been applied in verification, with the automaton type varying depending on the application domain. Adaptations of automata learning algorithms for increasingly complex types of automata have to be developed from scratch because there was no abstract theory offering guidelines. This makes it hard to devise such algorithms, and it obscures th...

Journal: :Discrete Mathematics & Theoretical Computer Science 2015
François Gonze Raphaël M. Jungers Avraham Trakhtman

We provide a counterexample to a lemma used in a recent tentative improvement of the the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate an open question, whose answer could fix the line of proof, and improve the bound.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید