DMCA
A process-algebraic language for probabilistic I/O automata (2003)
Cached
Download Links
- [bsd7.cs.sunysb.edu:18080]
- [bsd7.cs.sunysb.edu]
- [www.cs.umd.edu]
- [bsd7.cs.sunysb.edu]
- [www.cs.sunysb.edu]
- [www.cs.stonybrook.edu]
- [www3.cs.stonybrook.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. OF THE 14TH INT. CONF. ON CONCURRENCY THEORY (CONCUR 2003), LNCS |
| Citations: | 15 - 2 self |
BibTeX
@INPROCEEDINGS{Stark03aprocess-algebraic,
author = {Eugene W. Stark and Rance Cleaveland and Scott A. Smolka},
title = {A process-algebraic language for probabilistic I/O automata},
booktitle = {IN PROC. OF THE 14TH INT. CONF. ON CONCURRENCY THEORY (CONCUR 2003), LNCS},
year = {2003},
pages = {193--207},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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, which requires that all input actions be enabled in every state of a PIOA, we augment the language with a set of type inference rules. We also equip our language with a formal operational semantics defined by a set of transition rules. We present a number of results whose thrust is to establish that the typing and transition rules are sensible and interact properly. The central connection between types and transition systems is that if a term is well-typed, then in fact the associated transition system is input-enabled. We also consider two notions of equivalence for our language, weighted bisimulation equivalence and PIOA behavioral equivalence. We show that both equivalences are substitutive with respect to the operators of the language, and note that weighted bisimulation equivalence is a strict refinement of behavioral equivalence.
