Timed systems, such as timed automata, are usually analyzed using their operational
semantics on timed words. The classical region abstraction for timed automata reduces them …

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 …

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 …

In this paper, we analyze timed systems with data structures. We start by describing
behaviors of timed systems using graphs with timing constraints. Such a graph is called …

We present synchronized recursive timed automata (SRTA) that extend timed automata with
a stack. Each frame of a stack is composed of rational-valued clocks, and SRTA …

Recursive hybrid automata generalize recursive state machines in a similar way as hybrid
automata generalize state machines. Recursive hybrid automata can be considered as …

Timed automata were introduced by Alur et al. in the early 1990's as finite automata
augmented with finitely many (global) clocks. Adding clocks to finite automata enables us to …

This paper explores probabilistic timed automata (PTA) as an approach to fault tree analysis
(FTA) by modelling two synthetic dynamic fault trees (DFTs) using both PTA and continuous …

抄録 We present synchronized recursive timed automata (SRTA) that extend timed automata
with a stack in which each frame contains multiple real valued clocks. SRTA are an …