Sciweavers

Share
15 search results - page 1 / 3
» Irregular Behaviours for Probabilistic Automata
Sort
View
RP
2015
Springer
3 years 2 months ago
Irregular Behaviours for Probabilistic Automata
Abstract. We consider probabilistic automata over finite words. Such an automaton defines the language consisting of the set of words accepted with probability greater than a giv...
Nathanaël Fijalkow, Michal Skrzypczak
TCS
2010
8 years 27 days 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...
SIGSOFT
2009
ACM
9 years 7 months ago
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...
Esteban Pavese, Sebastián Uchitel, Ví...
FORMATS
2004
Springer
8 years 11 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
IFM
2007
Springer
104views Formal Methods» more  IFM 2007»
9 years 10 days ago
Probabilistic Timed Behavior Trees
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
Robert Colvin, Lars Grunske, Kirsten Winter
books