321 search results - page 7 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
ENTCS
2006
13 years 8 months ago
2006
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
TAMC
2009
Springer
14 years 3 months ago
2009
Springer
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
TCS
2010
13 years 3 months ago
2010
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
TACAS
2000
Springer
14 years 10 days ago
2000
Springer
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
LMCS
2006
13 years 8 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 ...