@inproceedings{10.1007/978-3-662-54458-7_8,
    Abstract = {Nominal sets are a convenient setting for languages over infinite alphabets, i.e. data languages. We introduce an automaton model over nominal sets, regular nondeterministic nominal automata (RNNA), which have a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word. We prove a Kleene theorem for RNNAs w.r.t. a simple expression language that extends nominal Kleene algebra (NKA) with unscoped name binding, thus remedying the known failure of the expected Kleene theorem for NKA itself. We analyse RNNAs under two notions of freshness: global and local. Under global freshness, RNNAs turn out to be equivalent to session automata, and as such have a decidable inclusion problem. Under local freshness, RNNAs retain a decidable inclusion problem, and translate into register automata. We thus obtain decidability of inclusion for a reasonably expressive class of nondeterministic register automata, with no bound on the number of registers.},
    Address = {Berlin, Heidelberg},
    Author = {Schr{\"o}der, Lutz and Kozen, Dexter and Milius, Stefan and Wi{\ss}mann, Thorsten},
    BookTitle = {Foundations of Software Science and Computation Structures},
    Editor = {Esparza, Javier and Murawski, Andrzej S.},
    File = {Schröder2017\_Chapter\_NominalAutomataWithNameBinding (0) - a - a - i.pdf},
    ISBN = {978-3-662-54458-7},
    Pages = {124--142},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Nominal Automata with Name Binding},
    Year = {2017},
    date-added = {2019-04-15 14:00:37 +0200},
    date-modified = {2019-04-15 14:00:37 +0200},
    doi = {10.1007/978-3-662-54458-7_8}
}

@inproceedings{10.1007/978-3-662-54458-7_8, Abstract = {Nominal sets are a convenient setting for languages over infinite alphabets, i.e. data languages. We introduce an automaton model over nominal sets, regular nondeterministic nominal automata (RNNA), which have a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word. We prove a Kleene theorem for RNNAs w.r.t. a simple expression language that extends nominal Kleene algebra (NKA) with unscoped name binding, thus remedying the known failure of the expected Kleene theorem for NKA itself. We analyse RNNAs under two notions of freshness: global and local. Under global freshness, RNNAs turn out to be equivalent to session automata, and as such have a decidable inclusion problem. Under local freshness, RNNAs retain a decidable inclusion problem, and translate into register automata. We thus obtain decidability of inclusion for a reasonably expressive class of nondeterministic register automata, with no bound on the number of registers.}, Address = {Berlin, Heidelberg}, Author = {Schr{\"o}der, Lutz and Kozen, Dexter and Milius, Stefan and Wi{\ss}mann, Thorsten}, BookTitle = {Foundations of Software Science and Computation Structures}, Editor = {Esparza, Javier and Murawski, Andrzej S.}, File = {Schröder2017_Chapter_NominalAutomataWithNameBinding (0) - a - a - i.pdf}, ISBN = {978-3-662-54458-7}, Pages = {124--142}, Publisher = {Springer Berlin Heidelberg}, Title = {Nominal Automata with Name Binding}, Year = {2017}, date-added = {2019-04-15 14:00:37 +0200}, date-modified = {2019-04-15 14:00:37 +0200}, doi = {10.1007/978-3-662-54458-7_8} }