87 search results - page 3 / 18 » GSOS for Probabilistic Transition Systems |
114
click to vote
LICS
2002
IEEE
15 years 2 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
POPL
2000
ACM
15 years 2 months ago
2000
ACM
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...
120
click to vote
CONCUR
2003
Springer
15 years 3 months ago
2003
Springer
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...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
150
click to vote
TGC
2010
Springer
14 years 7 months ago
2010
Springer
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...