Sciweavers

31 search results - page 2 / 7
» On the Decidability of Temporal Properties of Probabilistic ...
Sort
View
WIA
2001
Springer
13 years 9 months ago
Past Pushdown Timed Automata
d Abstract) Zhe Dang   , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard ...
DLT
2007
13 years 6 months ago
2-Visibly Pushdown Automata
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
Dario Carotenuto, Aniello Murano, Adriano Peron
RP
2009
Springer
124views Control Systems» more  RP 2009»
13 years 11 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
FSTTCS
2006
Springer
13 years 9 months ago
Branching Pushdown Tree Automata
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
Rajeev Alur, Swarat Chaudhuri
LICS
2006
IEEE
13 years 11 months ago
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
Dietrich Kuske, Markus Lohrey