10 search results - page 1 / 2 » Composition and Behaviors of Probabilistic I O Automata |
CONCUR
1994
Springer
13 years 9 months ago
1994
Springer
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...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
CONCUR
2001
Springer
13 years 9 months ago
2001
Springer
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
CAV
1993
Springer
13 years 9 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
CGF
2004
13 years 4 months ago
2004
Crowd simulation for virtual environments offers many challenges centered on the trade-offs between rich behavior, control and computational cost. In this paper we present a new a...