In this paper we obtain complexity bounds for computational problems on
...
Timed pushdown automata (TPDA) are an expressive formalism combining
rec...
Timed basic parallel processes (TBPP) extend communication-free Petri ne...
We study an expressive model of timed pushdown automata extended with mo...
We study the reachability problem for networks of timed communicating
pr...
We present efficient algorithms to reduce the size of nondeterministic
B...