Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

FMCO
2006
Springer

favoriteEmaildiscussreport

107views Formal Methods» more FMCO 2006»

Learning Meets Verification

14 years 2 months ago

Learning Meets Verification

Download www4.in.tum.de

In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions catering for specialized or richer classes of automata. Furthermore, we survey their recent application to verification problems.

Martin Leucker

Real-time Traffic

Angluin's Algorithms | FMCO 2006 | Formal Methods | Learning Automata | Richer Classes |

claim paper

Related Content

» Boosted MultiTask Learning for Face Verification With Applications to Web Image and Video ...

» Streamline verification process with formal property verification to meet highly compresse...

» Discovery of Educational Objective on ELearning Resource A Competency Approach

» Dafny Meets the Verification Benchmarks Challenge

» Is What You Write What You Get An Operational Model of Training Scenario

» The NITE XML Toolkit Meets the ICSI Meeting Corpus Import Annotation and Browsing

» Automatic MultiModal Meeting Camera Selection for VideoConferences and Meeting Browsers

» When Semisupervised Learning Meets Ensemble Learning

» Tracking of Multiple Targets Using Online Learning for Reference Model Adaptation

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	FMCO
Authors	Martin Leucker

Comments (0)