Sciweavers

391 search results - page 5 / 79
» Compositionality for Probabilistic Automata
Sort
View
TAMC
2009
Springer
14 years 2 months ago
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
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...
Jasper Berendsen, Taolue Chen, David N. Jansen
TCS
2010
13 years 2 months ago
Weak bisimulation for Probabilistic Timed Automata
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 ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
ECBS
2009
IEEE
113views Hardware» more  ECBS 2009»
14 years 2 months ago
Modeling and Analysis of Probabilistic Timed Systems
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
Abhishek Dubey, Derek Riley, Sherif Abdelwahed, Te...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
Model Checking Probabilistic Timed Automata with One or Two Clocks
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
Marcin Jurdzinski, François Laroussinie, Je...