A Theory of History Dependent Abstractions for Learning Interface Automata

DOI10.1007/978-3-642-32940-1_18zbMath1365.68339OpenAlexW1945898676MaRDI QIDQ2914374

Faranak Heidarian, Fides Aarts, Frits W. Vaandrager

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32940-1_18

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ Discovering directly-follows complete Petri nets from event data ⋮ Learning register automata: from languages to program structures ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction

This page was built for publication: A Theory of History Dependent Abstractions for Learning Interface Automata