Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages

D. Latella
(CNR – Istituto di Scienza e Tecnologie dell'Informazione 'A. Faedo')
M. Massink
(CNR – Istituto di Scienza e Tecnologie dell'Informazione 'A. Faedo')
E.P. de Vink
(Technische Universiteit Eindhoven and Centrum Wiskunde Informatica)

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.

In Ulrike Golas and Thomas Soboll: Proceedings Seventh ACCAT Workshop on Applied and Computational Category Theory (ACCAT 2012), Tallinn, Estonia, 01/04/2012, Electronic Proceedings in Theoretical Computer Science 93, pp. 23–43.
Published: 21st August 2012.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: