17 citations · 25 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2019
Undecidability of future timeline-based planning over dense temporal domains
Laura Bozzelli, Alberto Molinari, Angelo Montanari +1
Planning is one of the most studied problems in computer science. In this paper, we consider the timeline-based approach, where the domain is modeled by a set of independent, but i…
cs.FL2017
Event-Clock Nested Automata
Laura Bozzelli, Aniello Murano, Adriano Peron
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 exp…