Abstract
What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store fresh names, and to compare incoming names with previously stored ones. These finite machines extend Kaminski and Francez's Finite-Memory Automata by being able to recognise globally fresh inputs, that is, names fresh in the whole current run. We examine the expressivity of FRA's both from the aspect of accepted languages and of bisimulation equivalence. We establish primary properties and connections between automata of this kind, and answer key decidability questions. As a demonstrating example, we express the theory of the pi-calculus in FRA's and characterise bisimulation equivalence by an appropriate, and decidable in the finitary case, notion in these automata.
Supplemental Material
- S. Abramsky, D. R. Ghica, A. S. Murawski, C.-H. L. Ong, and I. D. B. Stark. Nominal games and full abstraction for the nu-calculus. In Proc. of LICS '04, pages 150--159. IEEE Comp. Soc. Press, 2004. Google Scholar
Digital Library
- M. Benedikt, C. Ley, and G. Puppis. Minimal memory automata. Alberto Mendelzon Workshop on Foundations of Databases, 2010.Google Scholar
- N. Benton and V. Koutavas. A mechanized bisimulation for the nu-calculus. Tech. Rep. MSR-TR-2008-129, Microsoft Research, 2008.Google Scholar
- R. Bruni, F. Honsell, M. Lenisa, and M. Miculan. Modeling fresh names in the pi-calculus using abstractions. In Proc. of CMCS '04, volume 106, pages 25--41. Elsevier, 2004.Google Scholar
- S. Delaune, S. Kremer, and M. Ryan. Symbolic bisimulation for the Applied Pi Calculus. In Proc. of FSTTCS '07, volume 4855 of LNCS, pages 133--145, 2007. Google Scholar
Digital Library
- S. Demri and R. Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3), 2009. Google Scholar
Digital Library
- G. L. Ferrari, U. Montanari, and E. Tuosto. Model checking for nominal calculi. In Proc. of FOSSACS '05, volume 3441 of LNCS, pages 1--24, 2005. Google Scholar
Digital Library
- M. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13(3--5):341--363, 2002.Google Scholar
- M. J. Gabbay and V. Ciancia. Freshness and name-restriction in sets of traces with names. Submitted for publication, 2010.Google Scholar
- A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. In LICS, pages 56--66, 1999. Google Scholar
Digital Library
- M. Kaminski and N. Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329--363, 1994. Google Scholar
Digital Library
- J. Laird. A game semantics of local names and good variables. In Proc. of FOSSACS '04, volume 2987 of LNCS, pages 289--303, 2004.Google Scholar
- J. Laird. A fully abstract trace semantics for general references. In Proc. of ICALP '07, volume 4596 of LNCS, pages 667--679, 2007. Google Scholar
Digital Library
- R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Inf. Comput., 100(1):1--77, 1992.Google Scholar
Digital Library
- R. Milner, M. Tofte, and D. Macqueen. The Definition of Standard ML. MIT Press, 1997. Google Scholar
Digital Library
- U. Montanari and M. Pistore. An introduction to History Dependent Automata. Electr. Notes Theor. Comput. Sci., 10, 1997.Google Scholar
Digital Library
- U. Montanari and M. Pistore. Structured coalgebras and minimal HD-automata for the pi-calculus. Theor. Comput. Sci., 340(3):539--576, 2005. Google Scholar
Digital Library
- A. S. Murawski and N. Tzevelekos. Full abstraction for Reduced ML. In Proc. of FOSSACS '09, volume 5504 of LNCS, pages 32--47, 2009. Google Scholar
Digital Library
- A. S. Murawski and N. Tzevelekos. Algorithmic nominal game semantics. Submitted for publication, 2010.Google Scholar
- R. M. Needham. Names. In S. Mullender, editor, Distributed systems, pages 315--327. ACM Press/Addison-Wesley, 1993. 2nd edition. Google Scholar
Digital Library
- F. Neven, T. Schwentick, and V. Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic, 5(3):403--435, 2004. Google Scholar
Digital Library
- M. Pistore. History Dependent Automata. PhD thesis, University of Pisa, 1999.Google Scholar
- A. M. Pitts. Nominal logic, a first order theory of names and binding. Inf. Comput., 186(2):165--193, 2003. Google Scholar
Digital Library
- A. M. Pitts and I. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Proc. of MFCS '93, number 711 in LNCS, pages 122--141, 1993. Google Scholar
Digital Library
- H. Sakamoto and D. Ikeda. Intractability of decision problems for finite-memory automata. Theor. Comput. Sci., 231(2):297--308, 2000. Google Scholar
Digital Library
- D. Sangiorgi and D. Walker. The pi-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001. Google Scholar
Digital Library
- L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In Proc. of CSL '06, vol. 4207 of LNCS, pages 41--57, 2006. Google Scholar
Digital Library
- I. Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, 1994.Google Scholar
Index Terms
Fresh-register automata
Recommendations
Fresh-register automata
POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesWhat is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to ...
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
AbstractWe investigate the complexity of the containment problem “Does hold?” for register automata and timed automata, where is assumed to be unambiguous and is arbitrary. We prove that the problem is decidable in the case of register ...
Synchronizing Data Words for Register Automata
Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data words in RAs: does there exist a data word that sends all states of the RA ...







Comments