Demonstrating Learning of Register Automata
| Autor: | Falk Howar, Maik Merten, Sofia Cassel, Bengt Jonsson, Bernhard Steffen |
|---|---|
| Přispěvatelé: | Cassel, Sofia, Emergent Connectors for Eternal Software Intensive Networked Systems - CONNECT - - EC:FP7:ICT2009-02-01 - 2012-11-30 - 231167 - VALID |
| Jazyk: | angličtina |
| Rok vydání: | 2012 |
| Předmět: |
Mealy machine
Theoretical computer science Automata learning Computer science 020207 software engineering 02 engineering and technology Intrusion detection system Nonlinear Sciences::Cellular Automata and Lattice Gases Automaton Register (music) 0202 electrical engineering electronic engineering information engineering [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT] 020201 artificial intelligence & image processing Computer Science::Formal Languages and Automata Theory ComputingMilieux_MISCELLANEOUS |
| Zdroj: | Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783642287558 TACAS |
| Popis: | We will demonstrate the impact of the integration of our most recently developed learning technology for inferring Register Automata into the LearnLib, our framework for active automata learning. This will not only illustrate the unique power of Register Automata, which allows one to faithfully model data independent systems, but also the ease of enhancing the LearnLib with new functionality. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|