skip to main content
research-article

Learning nominal automata

Published:01 January 2017Publication History
Skip Abstract Section

Abstract

We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this new setting. In particular we can learn a subclass of nominal non-deterministic automata. An implementation using a recently developed Haskell library for nominal computation is provided for preliminary experiments.

References

  1. Fides Aarts and Frits W. Vaandrager. Learning I/O automata. In CONCUR, pages 71–85, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Fides Aarts, Paul Fiterau-Brostean, Harco Kuppens, and Frits W. Vaandrager. Learning register automata with fresh value generation. In ICTAC, pages 165–183, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Dana Angluin. Learning regular sets from queries and counterexamples. Inf. Comput., 75(2):87–106, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dana Angluin and Mikl´os Csürös. Learning markov chains with variable memory length from noisy output. In COLT, pages 298–308, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Therese Berg, Bengt Jonsson, and Harald Raffelt. Regular inference for state machines with parameters. In FASE, pages 107–121, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Therese Berg, Bengt Jonsson, and Harald Raffelt. Regular inference for state machines using domains with equality tests. In FASE, pages 317–331, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Mikołaj Boja´nczyk and Sławomir Lasota. A machine-independent characterization of timed languages. In ICALP, pages 92–103, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Google ScholarGoogle Scholar
  10. Mikołaj Boja´nczyk, Laurent Braud, Bartek Klin, and Sławomir Lasota. Towards nominal computation. In POPL, pages 401–412, 2012. Google ScholarGoogle Scholar
  11. Mikołaj Boja´nczyk, Bartek Klin, and Slawomir Lasota. Automata theory in nominal sets. LMCS, 10(3), 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of nfa. Technical Report LSV-08-28, ENS de Cachan, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  13. Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of NFA. In IJCAI, pages 1004–1009, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Benedikt Bollig, Peter Habermehl, Martin Leucker, and Benjamin Monmege. A fresh approach to learning register automata. In DLT, pages 118–130, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Filippo Bonchi and Damien Pous. Hacking nondeterminism with induction and coinduction. Commun. ACM, 58(2):87–95, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Matko Botincan and Domagoj Babic. Sigma*: symbolic learning of input-output specifications. In POPL, pages 443–456, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Sofia Cassel, Falk Howar, Bengt Jonsson, and Bernhard Steffen. Active learning for extended finite state machines. Formal Asp. Comput., 28 (2):233–263, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Vincenzo Ciancia and Ugo Montanari. Symmetries, local names and dynamic (de)-allocation of names. Inf. Comput., 208(12):1349–1367, 2010. Google ScholarGoogle Scholar
  19. Loris D’Antoni and Margus Veanes. Minimization of symbolic automata. In POPL, pages 541–554, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 2535849.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Stéphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Franc¸ois Denis, Aurélien Lemay, and Alain Terlutte. Residual finite state automata. Fundam. Inform., 51(4):339–368, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Falk Howar, Bernhard Steffen, and Maik Merten. Automata learning with automated alphabet abstraction refinement. In VMCAI, pages 263–277, 2011. 19 Google ScholarGoogle Scholar
  24. Falk Howar, Bernhard Steffen, Bengt Jonsson, and Sofia Cassel. Inferring canonical register automata. In VMCAI, pages 251–266, 2012. Google ScholarGoogle ScholarCross RefCross Ref
  25. 17Google ScholarGoogle Scholar
  26. Malte Isberner, Falk Howar, and Bernhard Steffen. Inferring automata with state-local alphabet abstractions. In NFM, pages 124–138, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 9Google ScholarGoogle Scholar
  28. Malte Isberner, Falk Howar, and Bernhard Steffen. Learning register automata: from languages to program structures. Machine Learning, 96(1-2):65–98, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Bart Jacobs and Alexandra Silva. Automata learning: A categorical perspective. In Horizons of the Mind, pages 384–406, 2014, 20.Google ScholarGoogle ScholarCross RefCross Ref
  30. Michael Kaminski and Nissim Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329–363, 1994. Google ScholarGoogle Scholar
  31. Bartek Klin and Michał Szynwelski. SMT solving for functional programming over infinite structures. In MFSP, volume 207, pages 57–75, 2016.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Eryk Kopczy´nski and Szymon Toru´nczyk. LOIS: an application of SMT solvers. In SMT, volume 1617, pages 51–60, 2016.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Eryk Kopczy´nski and Szymon Toru´nczyk. LOIS: syntax and semantics. In POPL, 2017. This volume. Google ScholarGoogle Scholar
  34. Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan, and Alexandra Silva. Nominal kleene coalgebra. In ICALP, pages 286–298, 2015. Google ScholarGoogle ScholarCross RefCross Ref
  35. 23Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Oded Maler and Irini-Eleftheria Mens. Learning regular languages over large alphabets. In TACAS, pages 485–499, 2014, 41.Google ScholarGoogle Scholar
  37. Oded Maler and Amir Pnueli. On the learnability of infinitary regular sets. Inf. Comput., 118(2):316–326, 1995. Google ScholarGoogle Scholar
  38. 1070.Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Irini-Eleftheria Mens and Oded Maler. Learning regular languages over large ordered alphabets. LMCS, 11(3), 2015.Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Ugo Montanari and Matteo Sammartino. A network-conscious πcalculus and its coalgebraic semantics. Theor. Comput. Sci., 546:188– 224, 2014. Google ScholarGoogle Scholar
  41. Leonardo De Moura and Nikolaj Bjørner. Z3: An efficient smt solver. In TACAS, pages 337–340, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Oliver Niese. An integrated approach to testing complex systems. PhD thesis, Universität Dortmund, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Andrew M Pitts. Nominal sets: Names and symmetry in computer science. Cambridge University Press, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. Inf. Comput., 103(2):299–347, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Hiroshi Sakamoto. Learning simple deterministic finite-memory automata. In ALT, pages 416–431, 1997. Google ScholarGoogle Scholar
  46. Mark R. Shinwell. Fresh O’Caml: Nominal abstract syntax for the masses. ENTCS, 148(2):53–77, 2006. Google ScholarGoogle Scholar

Index Terms

  1. Learning nominal automata

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!