Sciweavers

87 search results - page 3 / 18
» GSOS for Probabilistic Transition Systems
Sort
View
LICS
2002
IEEE
13 years 10 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
POPL
2000
ACM
13 years 10 months ago
Transforming Out Timing Leaks
It has been shown that secret information can be leaked to external observers through covert timing channels. In this paper we are concerned with a kind of timing attack that want...
Johan Agat
CONCUR
2003
Springer
13 years 11 months ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
CONCUR
2001
Springer
13 years 10 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
TGC
2010
Springer
13 years 3 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti