A Process-Algebraic Language for Probabilistic I/O Automata
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.
Keywordsstochastic process algebras typing systems and algorithms process equivalences continuous-time Markov chains
Unable to display preview. Download preview PDF.
- [CPS93]Cleaveland, R., Parrow, J., Steffen, B.U.: The Concurrency Workbench: A semantics-based tool for the verification of concurrent systems. ACM TOPLAS 15(1) (1993)Google Scholar
- [DNS95]De Nicola, R., Segala, R.: A process algebraic view of Input/Output Automata. Theoretical Computer Science 138(2) (1995)Google Scholar
- [GL00]Garland, S.J., Lynch, N.A.: Using I/O automata for developing distributed systems. In: Leavens, G.T., Sitaraman, M. (eds.) Foundations of Component-Based Systems, pp. 285–312. Cambridge University Press, Cambridge (2000)Google Scholar
- [Hil94]Hillston, J.: The nature of synchronization. In: Herzog, U., Rettelbach, M. (eds.) Proceedings of the 2nd Workshop on Process Algebra and Performance Modeling, July 1994, pp. 51–70. University of Erlangen (1994)Google Scholar
- [JLY01]Jonsson, B., Larsen, K.G., Yi, W.: Probabilistic extensions of process algebras. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra. Elsevier, Amsterdam (2001)Google Scholar
- [LT87]Lynch, N.A., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pp. 137–151 (1987)Google Scholar
- [SS98]Stark, E.W., Smolka, S.: Compositional analysis of expected delays in networks of probabilistic I/O automata. In: Proc. 13th Annual Symposium on Logic in Computer Science, Indianapolis, IN, June 1998, pp. 466–477. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
- [Sta03]Stark, E.: On behavior equivalence for probabilistic I/O automata and its relationship to probabilistic bisimulation. Journal of Automata, Languages, and Combinatorics 8(2) (2003) (to appear)Google Scholar
- [Vaa91]Vaandrager, F.W.: On the relationship between process algebra and input/output automata. In: Sixth Annual Symposium on Logic in Computer Science (LICS 1991), Amsterdam, July 1991, pp. 387–398. Computer Society Press (1991)Google Scholar