@inproceedings{10.1007/978-3-030-31784-3_20,
    Abstract = {Register automata are one of the most studied automata models over infinite alphabets with applications in learning, systems modelling and program verification. We present an equivalence checker for deterministic register automata, called DEQ, based on a recent polynomial-time algorithm that employs group-theoretic techniques to achieve succinct representations of the search space. We compare the performance of our tool to other available implementations, notably in the learning library RALib and nominal frameworks LOIS and NLambda.},
    Address = {Cham},
    Author = {Murawski, A. S. and Ramsay, S. J. and Tzevelekos, N.},
    BookTitle = {Proc. of ATVA'19},
    Editor = {Chen, Yu-Fang and Cheng, Chih-Hong and Esparza, Javier},
    File = {DEQ- Equivalence Checker for Deterministic Register Automata - Murawski2019\_Chapter\_DEQEquivalenceCheckerForDeterm.pdf},
    ISBN = {978-3-030-31784-3},
    Pages = {350--356},
    Publisher = {Springer International Publishing},
    Title = {DEQ: Equivalence Checker for Deterministic Register Automata},
    Year = {2019},
    date-added = {2021-04-06 15:03:32 +0200},
    date-modified = {2021-04-06 15:03:43 +0200},
    doi = {10.1007/978-3-030-31784-3_20}
}

@inproceedings{10.1007/978-3-030-31784-3_20, Abstract = {Register automata are one of the most studied automata models over infinite alphabets with applications in learning, systems modelling and program verification. We present an equivalence checker for deterministic register automata, called DEQ, based on a recent polynomial-time algorithm that employs group-theoretic techniques to achieve succinct representations of the search space. We compare the performance of our tool to other available implementations, notably in the learning library RALib and nominal frameworks LOIS and NLambda.}, Address = {Cham}, Author = {Murawski, A. S. and Ramsay, S. J. and Tzevelekos, N.}, BookTitle = {Proc. of ATVA'19}, Editor = {Chen, Yu-Fang and Cheng, Chih-Hong and Esparza, Javier}, File = {DEQ- Equivalence Checker for Deterministic Register Automata - Murawski2019_Chapter_DEQEquivalenceCheckerForDeterm.pdf}, ISBN = {978-3-030-31784-3}, Pages = {350--356}, Publisher = {Springer International Publishing}, Title = {DEQ: Equivalence Checker for Deterministic Register Automata}, Year = {2019}, date-added = {2021-04-06 15:03:32 +0200}, date-modified = {2021-04-06 15:03:43 +0200}, doi = {10.1007/978-3-030-31784-3_20} }