31 search results - page 1 / 7 » On the Decidability of Temporal Properties of Probabilistic ... |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
CAV
2000
Springer
13 years 9 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
LMCS
2006
13 years 4 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...