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