@inproceedings{10.1007/978-3-319-77313-1_6,
    Abstract = {In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of recursive programs. We prove that ECNA retain the closure and decidability properties of ECA and VPA being closed under Boolean operations and having a decidable language-inclusion problem. In particular, we prove that emptiness, universality, and language-inclusion for ECNA are Exptime-complete problems. As for the expressiveness, we have that ECNA properly extend any previous attempt in the literature of combining ECA and VPA.},
    Address = {Cham},
    Author = {Bozzelli, Laura and Murano, Aniello and Peron, Adriano},
    BookTitle = {Language and Automata Theory and Applications},
    Editor = {Klein, Shmuel Tomi and Mart{\'\i}n-Vide, Carlos and Shapira, Dana},
    File = {10.1007\%2F978-3-319-77313-1\_6 (0) - a - a - m.pdf},
    ISBN = {978-3-319-77313-1},
    Pages = {80--92},
    Publisher = {Springer International Publishing},
    Title = {Event-Clock Nested Automata},
    Year = {2018},
    date-added = {2018-05-30 11:58:01 +0000},
    date-modified = {2018-05-30 11:58:01 +0000},
    file-2 = {Event-cost (0) - a - a - m.pdf},
    file-3 = {1711.08314 (0) - a - a - m.pdf},
    doi = {10.1007/978-3-319-77313-1_6}
}

@inproceedings{10.1007/978-3-319-77313-1_6, Abstract = {In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of recursive programs. We prove that ECNA retain the closure and decidability properties of ECA and VPA being closed under Boolean operations and having a decidable language-inclusion problem. In particular, we prove that emptiness, universality, and language-inclusion for ECNA are Exptime-complete problems. As for the expressiveness, we have that ECNA properly extend any previous attempt in the literature of combining ECA and VPA.}, Address = {Cham}, Author = {Bozzelli, Laura and Murano, Aniello and Peron, Adriano}, BookTitle = {Language and Automata Theory and Applications}, Editor = {Klein, Shmuel Tomi and Mart{\'\i}n-Vide, Carlos and Shapira, Dana}, File = {10.1007\%2F978-3-319-77313-1_6 (0) - a - a - m.pdf}, ISBN = {978-3-319-77313-1}, Pages = {80--92}, Publisher = {Springer International Publishing}, Title = {Event-Clock Nested Automata}, Year = {2018}, date-added = {2018-05-30 11:58:01 +0000}, date-modified = {2018-05-30 11:58:01 +0000}, file-2 = {Event-cost (0) - a - a - m.pdf}, file-3 = {1711.08314 (0) - a - a - m.pdf}, doi = {10.1007/978-3-319-77313-1_6} }