GSOS for probabilistic transition systems (Extended Abstract) (2002)
| Venue: | Proc. Coalgebraic Methods in Computer Science (CMCS 2002), volume 65 of Electronic Notes in Theoretical Computer Science |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Bartels02gsosfor,
author = {Falk Bartels},
title = {GSOS for probabilistic transition systems (Extended Abstract)},
booktitle = {Proc. Coalgebraic Methods in Computer Science (CMCS 2002), volume 65 of Electronic Notes in Theoretical Computer Science},
year = {2002},
publisher = {Elsevier Science Publishers}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the up-to-context proof principle is valid. Moreover, every specification has a final model which can be shown to offer unique solutions for guarded recursive equations. The format covers operator specifications from the literature, so that the well-behavedness results given for those arise as instances of our general one.
