@article(Angluin87, author = {Dana Angluin}, year = {1987}, title = {{Learning Regular Sets from Queries and Counterexamples}}, journal = {Inf. Comput.}, volume = {75}, number = {2}, pages = {87--106}, doi = {10.1016/0890-5401(87)90052-6}, ) @inproceedings(Angluin17, author = {Dana Angluin and Tyler Dohrn}, year = {2017}, title = {{The Power of Random Counterexamples}}, booktitle = {International Conference on Algorithmic Learning Theory, {ALT} 2017, 15-17 October 2017, Kyoto University, Kyoto, Japan}, pages = {452--465}, url = {http://proceedings.mlr.press/v76/angluin17a.html}, ) @article(BartolettiDFZ09, author = {Massimo Bartoletti and Pierpaolo Degano and Gian~Luigi Ferrari and Roberto Zunino}, year = {2009}, title = {Local policies for resource usage analysis}, journal = {ACM Trans. Program. Lang. Syst.}, volume = {31}, number = {6}, doi = {10.1145/1552309.1552313}, ) @article(BojanczykKL14, author = {Miko{\l}aj Boja{\'{n}}czyk and Bartek Klin and Slawomir Lasota}, year = {2014}, title = {{Automata theory in nominal sets}}, journal = {Logical Methods in Computer Science}, volume = {10}, number = {3}, doi = {10.2168/LMCS-10(3:4)2014}, ) @inproceedings(BolligHLM13, author = {Benedikt Bollig and Peter Habermehl and Martin Leucker and Benjamin Monmege}, year = {2013}, title = {{A Fresh Approach to Learning Register Automata}}, booktitle = {Developments in Language Theory - 17th International Conference, {DLT}2013, Marne-la-Vall{\'{e}}e, France, June 18-21, 2013. Proceedings}, pages = {118--130}, doi = {10.1007/978-3-642-38771-5\_12}, ) @article(LCAfromMSCs, author = {Benedikt Bollig and Joost{-}Pieter Katoen and Carsten Kern and Martin Leucker}, year = {2010}, title = {{Learning Communicating Automata from MSCs}}, journal = {{IEEE} Trans. Software Eng.}, volume = {36}, number = {3}, pages = {390--408}, doi = {10.1109/TSE.2009.89}, ) @article(bz83, author = {Daniel Brand and Pitro Zafiropulo}, year = {1983}, title = {{On Communicating Finite-State Machines}}, journal = {JACM}, volume = {30}, number = {2}, pages = {323--342}, doi = {10.1145/322374.322380}, ) @article(CasselHJS16, author = {Sofia Cassel and Falk Howar and Bengt Jonsson and Bernhard Steffen}, year = {2016}, title = {Active learning for extended finite state machines}, journal = {Formal Asp. Comput.}, volume = {28}, number = {2}, pages = {233--263}, doi = {10.1007/s00165-016-0355-5}, ) @proceedings(Moerman17, editor = {Giuseppe Castagna and Andrew~D. Gordon}, year = {2017}, title = {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of Programming Languages, {POPL} 2017, Paris, France, January 18-20, 2017}, publisher = {{ACM}}, doi = {10.1145/3009837}, ) @inproceedings(dfm12, author = {Pierpaolo Degano and Gian~Luigi Ferrari and Gianluca Mezzetti}, year = {2012}, title = {Nominal Automata for Resource Usage Control}, booktitle = {Implementation and Application of Automata - 17th International Conference, {CIAA} 2012, Porto, Portugal, July 17-20, 2012. Proceedings}, pages = {125--137}, doi = {10.1007/978-3-642-31606-7\_11}, ) @inproceedings(dfm13, author = {Pierpaolo Degano and Gian~Luigi Ferrari and Gianluca Mezzetti}, year = {2013}, title = {Towards Nominal Context-Free Model-Checking}, booktitle = {Implementation and Application of Automata - 18th International Conference, {CIAA} 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings}, pages = {109--121}, doi = {10.1007/978-3-642-39274-0\_11}, ) @inproceedings(ffgmpr97, author = {Gianluigi Ferrari and Giovanni Ferro and Stefania Gnesi and Ugo Montanari and Marco Pistore and Gioia Ristori}, year = {1997}, title = {An Automata Based Verification Environment for Mobile Processes}, editor = {Ed~Brinksma}, booktitle = {TACAS}, series = {LNCS}, volume = {1217}, publisher = {Springer}, pages = {275--289}, ) @inproceedings(fgmpr98, author = {Gianluigi Ferrari and Stefania Gnesi and Ugo Montanari and Marco Pistore and Gioia Ristori}, year = {1998}, title = {{Verifying Mobile Processes in the HAL Environment}}, booktitle = {Proc. 10th International Computer Aided Verification Conference}, pages = {511--515}, doi = {10.1007/BFb0028772}, ) @inproceedings(fmp02, author = {Gianluigi Ferrari and Ugo Montanari and Marco Pistore}, year = {2002}, title = {Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation}, editor = {Mogens Nielsen and Uffe Engberg}, booktitle = {Foundations of Software Science and Computation Structures}, publisher = {Springer Berlin Heidelberg}, address = {Berlin, Heidelberg}, pages = {129--143}, doi = {10.1007/3-540-45931-6\_10}, ) @phdthesis(gabbay:thesis, author = {Murdoch~J. Gabbay}, year = {2001}, title = {\href{http://www.gabbay.org.uk/papers.html\#thesis}{A Theory of Inductive Definitions with alpha-Equivalence}}, type = {phdthesis}, school = {University of Cambridge, UK}, url = {http://www.gabbay.org.uk/papers.html\#thesis}, ) @inproceedings(gp99, author = {{Murdoch J.} Gabbay and {Andrew M.} Pitts}, year = {1999}, title = {A New Approach to Abstract Syntax Involving Binders}, editor = {Giuseppe Longo}, booktitle = {LICS}, publisher = {IEEE}, address = {Trento, Italy}, pages = {214--224}, doi = {10.1109/LICS.1999.782617}, ) @article(gp02, author = {{Murdoch J.} Gabbay and {Andrew M.} Pitts}, year = {2002}, title = {{A New Approach to Abstract Syntax with Variable Binding}}, journal = {J. of Formal Aspects of Computing}, volume = {13}, number = {3-5}, pages = {341--363}, doi = {10.1007/s001650200016}, ) @article(GadducciMM06, author = {Fabio Gadducci and Marino Miculan and Ugo Montanari}, year = {2006}, title = {About permutation algebras, (pre)sheaves and named sets}, journal = {Higher-Order and Symbolic Computation}, volume = {19}, number = {2-3}, pages = {283--304}, doi = {10.1007/s10990-006-8749-3}, ) @article(Hopcroft1979, author = {John~E. Hopcroft and Rajeev Motwani and Jeffrey~D. Ullman}, year = {2001}, title = {Introduction to Automata Theory, Languages, and Computation, 2Nd Edition}, journal = {SIGACT News}, volume = {32}, number = {1}, pages = {60--65}, doi = {10.1145/568438.568455}, ) @incollection(LAinCP, author = {Bart Jacobs and Alexandra Silva}, year = {2014}, title = {{Automata learning: A categorical perspective}}, booktitle = {Horizons of the Mind. A Tribute to Prakash Panangaden}, publisher = {Springer}, pages = {384--406}, doi = {10.1007/978-3-319-06880-0\_20}, ) @article(kami-fran:TCS94, author = {Michael Kaminski and Nissim Francez}, year = {1994}, title = {Finite-Memory Automata}, journal = {Theor. Comput. Sci.}, volume = {134}, number = {2}, pages = {329--363}, doi = {10.1016/0304-3975(94)90242-9}, ) @article(KaminskiT06, author = {Michael Kaminski and Tony Tan}, year = {2006}, title = {Regular Expressions for Languages over Infinite Alphabets}, journal = {Fundam. Inform.}, volume = {69}, number = {3}, pages = {301--318}, doi = {10.1007/978-3-540-27798-9\_20}, ) @inproceedings(kle56, author = {{Stephen C.} Kleene}, year = {1956}, title = {Representation of Events in Nerve Nets and Finite Automata}, editor = {John Shannon, {Claude E.}~McCarthy}, booktitle = {Automata Studies}, publisher = {Princeton University Press}, pages = {3--42}, ) @inproceedings(KozenMP015, author = {Dexter Kozen and Konstantinos Mamouras and Daniela Petrisan and Alexandra Silva}, year = {2015}, title = {Nominal Kleene Coalgebra}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}}, pages = {286--298}, doi = {10.1007/978-3-662-47666-6\_23}, ) @inproceedings(Kurz0T12, author = {Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto}, year = {2012}, title = {A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions}, booktitle = {Theoretical Computer Science - 7th {IFIP} {TC} 1/WG 2.2 International Conference, {TCS} 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings}, pages = {193--208}, doi = {10.1007/978-3-642-33475-7\_14}, ) @inproceedings(Kurz0T2012, author = {Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto}, year = {2012}, title = {{On Nominal Regular Languages with Binders}}, editor = {Lars Birkedal}, booktitle = {Foundations of Software Science and Computational Structures}, publisher = {Springer Berlin Heidelberg}, address = {Berlin, Heidelberg}, pages = {255--269}, doi = {10.1007/978-3-642-28729-9\_17}, ) @article(Kurz0T13, author = {Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto}, year = {2013}, title = {{Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract}}, journal = {CoRR}, volume = {abs/1310.7093}, url = {http://arxiv.org/abs/1310.7093}, ) @book(mil99, author = {Robin Milner}, year = {1999}, title = {Communicating and mobile systems - the Pi-calculus}, publisher = {Cambridge University Press}, ) @article(mpw92, author = {Robin Milner and Joachim Parrow and David Walker}, year = {1992}, title = {A Calculus of Mobile Processes, {I}}, journal = {Inf. Comput.}, volume = {100}, number = {1}, pages = {1--40}, doi = {10.1016/0890-5401(92)90008-4}, ) @inproceedings(mp00, author = {Ugo Montanari and Marco Pistore}, year = {2000}, title = {pi-Calculus, Structured Coalgebras, and Minimal HD-Automata}, booktitle = {Mathematical Foundations of Computer Science 2000, 25th International Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings}, pages = {569--578}, doi = {10.1007/3-540-44612-5\_52}, ) @phdthesis(Niese2003, author = {Oliver Niese}, year = {2003}, title = {{An integrated approach to testing complex systems}}, school = {Technical University of Dortmund, Germany}, url = {http://eldorado.uni-dortmund.de:8080/0x81d98002\_0x0007b62b}, ) @article(PasareanuGBCB08, author = {Corina~S. Pasareanu and Dimitra Giannakopoulou and Mihaela~Gheorghiu Bobaru and Jamieson~M. Cobleigh and Howard Barringer}, year = {2008}, title = {{Learning to divide and conquer: applying the $\unhbox\voidb@x \hbox{$\textsf{L}^\star$}\xspace$ algorithm to automate assume-guarantee reasoning}}, journal = {Formal Methods in System Design}, volume = {32}, number = {3}, pages = {175--205}, doi = {10.1007/s10703-008-0049-6}, ) @phdthesis(pis99, author = {Marco Pistore}, year = {1999}, title = {{History Dependent Automata}}, school = {Dipartimento di Informatica, Universit{\`a} di Pisa}, ) @inproceedings(Pitts15, author = {Andrew~M. Pitts}, year = {2015}, title = {{Names and Symmetry in Computer Science (Invited Tutorial)}}, booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2015, Kyoto, Japan, July 6-10, 2015}, pages = {21--22}, doi = {10.1109/LICS.2015.12}, ) @book(sw02, author = {Davide Sangiorgi and David Walker}, year = {2001}, title = {The Pi-Calculus - a theory of mobile processes}, publisher = {Cambridge University Press}, ) @inproceedings(SchroderKMW17, author = {Lutz Schr{\"{o}}der and Dexter Kozen and Stefan Milius and Wi{\ss}mann, Thorsten}, year = {2017}, title = {Nominal Automata with Name Binding}, booktitle = {Foundations of Software Science and Computation Structures - 20th International Conference, {FOSSACS} 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings}, pages = {124--142}, doi = {10.1007/978-3-662-54458-7\_8}, ) @inproceedings(segoufin2006, author = {Luc Segoufin}, year = {2006}, title = {Automata and Logics for Words and Trees over an Infinite Alphabet}, booktitle = {Computer Science Logic, 20th International Workshop, {CSL} 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings}, pages = {41--57}, doi = {10.1007/11874683\_3}, )