Coalgebra Learning via Duality

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as tests, based on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.

[1]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[2]  Frits W. Vaandrager,et al.  Model learning , 2017, Commun. ACM.

[3]  Sally Popkorn,et al.  A Handbook of Categorical Algebra , 2009 .

[4]  Paul Taylor,et al.  Practical Foundations of Mathematics , 1999, Cambridge studies in advanced mathematics.

[5]  James Worrell,et al.  Testing Semantics: Connecting Processes and Process Logics , 2006, AMAST.

[6]  Bart Jacobs,et al.  Introduction to Coalgebra: Towards Mathematics of States and Observation , 2016, Cambridge Tracts in Theoretical Computer Science.

[7]  Felix Hueber,et al.  Locally Presentable And Accessible Categories , 2016 .

[8]  Dirk Pattinson,et al.  Coalgebraic semantics of modal logics: An overview , 2011, Theor. Comput. Sci..

[9]  Jan J. M. M. Rutten,et al.  Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.

[10]  Alexandra Silva,et al.  CALF: Categorical Automata Learning Framework , 2017, CSL.

[11]  Dana Fisman,et al.  Learning Regular Languages via Alternating Automata , 2015, IJCAI.

[12]  Jurriaan Rot,et al.  Coalgebraic Trace Semantics via Forgetful Logics , 2015, FoSSaCS.

[13]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[14]  Ana Sokolova,et al.  Exemplaric Expressivity of Modal Logics , 2010, J. Log. Comput..

[15]  Clemens Kupke,et al.  Angluin Learning via Logic , 2018, LFCS.

[16]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[17]  Alexandra Silva,et al.  Trace semantics via determinization , 2012, J. Comput. Syst. Sci..

[18]  Věra Trnková,et al.  On descriptive classification of set-functors. II. , 1971 .

[19]  Francis Borceux,et al.  Handbook of Categorical Algebra: Bibliography , 1994 .

[20]  Marcello M. Bonsangue,et al.  Duality for Logics of Transition Systems , 2005, FoSSaCS.

[21]  Alexandra Silva,et al.  Automata Learning: A Categorical Perspective , 2014, Horizons of the Mind.

[22]  Jirí Adámek,et al.  Recursive coalgebras of finitary functors , 2007, RAIRO Theor. Informatics Appl..

[23]  Gerhard Osius,et al.  Categorical set theory: A characterization of the category of sets , 1974 .

[24]  Alexander Kurz,et al.  Algebraic Semantics for Coalgebraic Logics , 2004, CMCS.

[25]  Alexandra Silva,et al.  Learning Automata with Side-Effects , 2017, CMCS.

[26]  Jirí Adámek,et al.  Well-Pointed Coalgebras , 2013, Log. Methods Comput. Sci..

[27]  Bartek Klin,et al.  Coalgebraic Modal Logic Beyond Sets , 2007, MFPS.

[28]  Amir Pnueli,et al.  On the learnability of infinitary regular sets , 1991, COLT '91.

[29]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..