Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STACS
2005
Springer

favoriteEmaildiscussreport

86views Theoretical Computer Science» more STACS 2005»

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata

13 years 10 months ago

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata

Download www.fi.muni.cz

Tomás Brázdil, Antonín Kucera

Real-time Traffic

STACS 2005 | Theoretical Computer Science |

claim paper

Related Content

» Binary Reachability Analysis of Discrete Pushdown Timed Automata

» Model Checking Probabilistic Pushdown Automata

» Visibly Pushdown Games

» Properties of Visibly Pushdown Transducers

» Past Pushdown Timed Automata

» 2Visibly Pushdown Automata

» Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order

» Branching Pushdown Tree Automata

» Monadic Chain Logic Over Iterations and Applications to Pushdown Systems

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Tomás Brázdil, Antonín Kucera, Oldrich Strazovský

Comments (0)