Latella D., Massink M., De Vink E. P. Bisimulation of labeled state-to-function transition systems of stochastic process languages. In: ACCAT 2012 - Seventh ACCAT Workshop on Applied and Computational Category Theory (Tallin, Estonia, 4 april 2012). Proceedings, vol. 93 pp. 23 - 43. Ulrike Golas, Thomas Soboll (eds.). Electronic Proceedings in Theoretical Computer Science (EPTCS), 2012. |

Abstract (English) |
Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings. As such they constitute a convenient modeling instrument to deal with stochastic process languages. In this paper, the notion of bisimulation induced by a FuTS is proposed and a correspondence result is proven stating that FuTS-bisimulation coincides with the behavioral equivalence of the associated functor. As generic examples, the concrete existing equivalences for the core of the process algebras ACP, PEPA and IMC are related to the bisimulation of specific FuTS, providing via the correspondence result coalgebraic justification of the equivalences of these calculi | |

URL: | http://cgi.cse.unsw.edu.au/~rvg/eptcs/Published/ACCAT2012/Papers/4/paper/accat.pdf | |

DOI: | 10.4204/EPTCS.93.2 | |

Subject | Category Theory Coalgebras Continuous Time Markov Chains Stochastic Process Calculi Structured Operational Semantics H.1 MODELS AND PRINCIPLES F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES 68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |

1) Download Document PDF |

Open access Restricted Private