3 search results - page 1 / 1 » Probabilistic I O Automata: Theories of Two Equivalences |
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
CAV
1993
Springer
13 years 8 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...
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...