Sciweavers

8 search results - page 1 / 2
» Probabilistic Automata: System Types, Parallel Composition a...
Sort
View
VOSS
2004
Springer
125views Mathematics» more  VOSS 2004»
13 years 10 months ago
Probabilistic Automata: System Types, Parallel Composition and Comparison
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper...
Ana Sokolova, Erik P. de Vink
CONCUR
1994
Springer
13 years 9 months ago
Composition and Behaviors of Probabilistic I/O Automata
We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchron...
Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
CONCUR
2010
Springer
13 years 5 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
EPEW
2010
Springer
13 years 6 months ago
Composing Systems While Preserving Probabilities
Abstract. Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. Th...
Sonja Georgievska, Suzana Andova
CONCUR
2003
Springer
13 years 10 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