The paper proposes a temporal extension of Recursive State Machines (RSMs), called
Timed RSMs (TRSMs), which consists of an indexed collection of Timed Automata, called …

A nested timed automaton (NeTA) is a pushdown system whose control locations and stack
alphabet are timed automata (TAs). A control location describes a working TA, and the stack …

This paper investigates a general framework of a pushdown system with well-quasi-ordered
states and stack alphabet to show decidability of reachability, which is an extension of our …

Perfect languages, characterized by closure under Boolean operations and decidable
emptiness problem, form the basis for decidable automata-theoretic model-checking for the …

The focus of this paper is the analysis of real-time systems with recursion, through the
development of good theoretical techniques which are implementable. Time is modeled …

Schedulability analysis is one of the most important issues in developing and analyzing real-
time systems. Given a task system where each task is characterized by a worst-case …

Timed pushdown automata (tpda) are an expressive formalism combining recursion with a
rich logic of timing constraints. We prove that reachability relations of tpda are expressible in …

Pushdown systems with transductions (TrPDSs) are an extension of pushdown systems
(PDSs) by associating each transition rule with a transduction, which allows to inspect and …

Integer reset timed automata (IRTA) are known to be a determinizable subclass of timed
automata, but it is not known whether they are input-determined, ie, the clock values are …

As an extension of Timed Automata (TAs), Updatable Timed Automata (UTAs) proposed by
Bouyer et al. have the ability to update clocks in a more elaborate way than simply reset …