DMCA
Fresh-register automata (2011)
| Venue: | In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’11 |
| Citations: | 13 - 1 self |
BibTeX
@INPROCEEDINGS{Tzevelekos11fresh-registerautomata,
author = {Nikos Tzevelekos},
title = {Fresh-register automata},
booktitle = {In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’11},
year = {2011},
pages = {295--306}
}
Share
 |
 |
 |
 |
||
OpenURL
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 exam-ine 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 an-swer 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.
Keyphrases
fresh-register automaton an-swer key decidability question infinite alphabet fresh-name generation finite machine bisimulation equivalence new class whole current run characterise bisimulation equivalence fresh input finitary case accepted language basic automata-theoretic model fresh name demonstrating example finite number finite-memory automaton primary property
