@article{CASSEL201554,
    Abstract = {We present a novel canonical automaton model, based on register automata, that can be used to specify protocol or program behavior. Register automata have a finite control structure and a finite number of registers (variables), and process sequences of terms that carry data values from an infinite domain. We consider register automata that compare data values for equality. A major contribution is the definition of a canonical automaton representation of any language recognizable by a deterministic register automaton, by means of a Nerode congruence. This canonical form is well suited for modeling, e.g., protocols or program behavior. Our model can be exponentially more succinct than previous proposals, since it filters out `accidental' relations between data values. This opens the way to new practical applications, e.g., in automata learning.},
    Author = {Cassel, Sofia and Howar, Falk and Jonsson, Bengt and Merten, Maik and Steffen, Bernhard},
    File = {A succinct canonical register automaton model - 1-s2.0-S2352220814000509-main - a - y.pdf},
    ISSN = {2352-2208},
    Journal = {Journal of Logical and Algebraic Methods in Programming},
    Keywords = {Register automata, Data languages, Canonical model, Myhill--Nerode, Automata theory},
    Note = {Special Issue: The 23rd Nordic Workshop on Programming Theory (NWPT 2011) Special Issue: Domains X, International workshop on Domain Theory and applications, Swansea, 5-7 September, 2011},
    Number = {1},
    Pages = {54 - 66},
    Title = {A succinct canonical register automaton model},
    URL = {http://www.sciencedirect.com/science/article/pii/S2352220814000509},
    Volume = {84},
    Year = {2015},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S2352220814000509},
    bdsk-url-2 = {https://doi.org/10.1016/j.jlamp.2014.07.004},
    date-added = {2020-10-16 16:51:58 +0200},
    date-modified = {2020-10-16 16:51:58 +0200},
    doi = {10.1016/j.jlamp.2014.07.004}
}

@article{CASSEL201554, Abstract = {We present a novel canonical automaton model, based on register automata, that can be used to specify protocol or program behavior. Register automata have a finite control structure and a finite number of registers (variables), and process sequences of terms that carry data values from an infinite domain. We consider register automata that compare data values for equality. A major contribution is the definition of a canonical automaton representation of any language recognizable by a deterministic register automaton, by means of a Nerode congruence. This canonical form is well suited for modeling, e.g., protocols or program behavior. Our model can be exponentially more succinct than previous proposals, since it filters out `accidental' relations between data values. This opens the way to new practical applications, e.g., in automata learning.}, Author = {Cassel, Sofia and Howar, Falk and Jonsson, Bengt and Merten, Maik and Steffen, Bernhard}, File = {A succinct canonical register automaton model - 1-s2.0-S2352220814000509-main - a - y.pdf}, ISSN = {2352-2208}, Journal = {Journal of Logical and Algebraic Methods in Programming}, Keywords = {Register automata, Data languages, Canonical model, Myhill--Nerode, Automata theory}, Note = {Special Issue: The 23rd Nordic Workshop on Programming Theory (NWPT 2011) Special Issue: Domains X, International workshop on Domain Theory and applications, Swansea, 5-7 September, 2011}, Number = {1}, Pages = {54 - 66}, Title = {A succinct canonical register automaton model}, URL = {http://www.sciencedirect.com/science/article/pii/S2352220814000509}, Volume = {84}, Year = {2015}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S2352220814000509}, bdsk-url-2 = {https://doi.org/10.1016/j.jlamp.2014.07.004}, date-added = {2020-10-16 16:51:58 +0200}, date-modified = {2020-10-16 16:51:58 +0200}, doi = {10.1016/j.jlamp.2014.07.004} }