Learning I/O automata

DOI10.1007/978-3-642-15375-4_6MaRDI QIDQ3584922zbMATH OpenOpenAlexFDO

Authors Fides Aarts, F. Vaandrager

Publication date 31 August 2010

Published in CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15375-4_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Recommendations

• Learning Moore machines from input-output traces
• A theory of history dependent abstractions for learning interface automata
• Specifying and verifying external behaviour of fair input/output automata by using the temporal logic of actions
• scientific article; zbMATH DE number 4213439
• Benchmarking combinations of learning and testing algorithms for active automata learning

Cited in

(23)

• An algebraic theory of interface automata
• A categorical framework for learning generalised tree automata
• Learning pomset automata
• scientific article; zbMATH DE number 7447738 (Why is no real title available?)
• Learning one-clock timed automata
• scientific article; zbMATH DE number 7447748 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• Learning and characterizing fully-ordered lattice automata
• Learning deterministic probabilistic automata from a model checking perspective
• From languages to behaviors and back
• A theory of history dependent abstractions for learning interface automata
• Regular \(\omega\)-languages with an informative right congruence
• Concurrent Kleene algebra with observations: from hypotheses to completeness
• Improving active Mealy machine learning for protocol conformance testing
• Learning register automata: from languages to program structures
• A pre-congruence format for \(XY\)-simulation
• A linear-time branching-time perspective on interface automata
• Polynomial identification of \(\omega \)-automata
• Inferring Symbolic Automata
• Inferring regular languages and \(\omega\)-languages
• A new approach for active automata learning based on apartness
• Relating alternating relations for conformance and refinement
• Logical characterisations, rule formats and compositionality for input-output conformance simulation

This page was built for publication: Learning I/O automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584922)