Compositional reasoning for probabilistic finite-state behaviors (2005)
Cached
Download Links
- [www.lix.polytechnique.fr]
- [www.cse.unsw.edu.au]
- [www.pps.jussieu.fr]
- [www.pps.jussieu.fr]
- [www.cs.cmu.edu]
- [basics.sjtu.edu.cn]
- DBLP
Other Repositories/Bibliography
| Venue: | In Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, LNCS 3838 |
| Citations: | 15 - 5 self |
BibTeX
@INPROCEEDINGS{Deng05compositionalreasoning,
author = {Yuxin Deng and Catuscia Palamidessi and Jun Pang},
title = {Compositional reasoning for probabilistic finite-state behaviors},
booktitle = {In Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, LNCS 3838},
year = {2005},
pages = {309--337},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 strong bisimulation and observational equivalence, and provide complete axiomatizations for a language that includes parallel composition and (guarded) recursion. The presence of the parallel composition introduces various technical difficulties and some restrictions are necessary in order to achieve complete axiomatizations. 1
