Event-Clock Nested Automata
Formal Languages and Automata Theory
2017-11-23 v1
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 same 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.
Keywords
Cite
@article{arxiv.1711.08314,
title = {Event-Clock Nested Automata},
author = {Laura Bozzelli and Aniello Murano and Adriano Peron},
journal= {arXiv preprint arXiv:1711.08314},
year = {2017}
}