Learning I/O Automata
From MaRDI portal
Publication:3584922
DOI10.1007/978-3-642-15375-4_6zbMath1287.68087OpenAlexW1840142437MaRDI QIDQ3584922
Fides Aarts, Frits W. 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
Related Items (19)
Learning One-Clock Timed Automata ⋮ A Pre-congruence Format for XY-simulation ⋮ Inferring regular languages and \(\omega\)-languages ⋮ A linear-time branching-time perspective on interface automata ⋮ An algebraic theory of interface automata ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Logical characterisations, rule formats and compositionality for input-output conformance simulation ⋮ Inferring Symbolic Automata ⋮ Learning and characterizing fully-ordered lattice automata ⋮ From languages to behaviors and back ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Learning register automata: from languages to program structures ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ Learning pomset automata ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ A categorical framework for learning generalised tree automata
This page was built for publication: Learning I/O Automata
