Rooted branching bisimulation as a congruence for probabilistic transition systems

• Autores: Lee, Matías David; de Vink, Erik P.
• Año de publicación: 2015
• Idioma: inglés
• Tipo de recurso: documento de conferencia
• Fuente: ISSN: 2075-2180
• Materia: Branching bisimulations; Probabilistic transition systems; Rules formats
• Institución: Universidad Nacional de Córdoba

Ponencia presentada en el 13 International Workshop on Quantitative Aspects of Programming Languages and Systems. London, United Kingdom, April 11-12, 2015.
Fil: Lee, Matías David. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina.
Fil: de Vink, Erik P. Eindhoven University of Technology; The Netherlands.
Fil: de Vink, Erik P. Centrum Wiskunde & Informatica; The Netherlands.
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case. For this to work, the theory of transition system specifications in the setting of labeled transition systems needs to be extended to deal with probability distributions, both syntactically and semantically. We provide a scheduler-free characterization of probabilistic branching bisimulation as adapted from work of Andova et al. for the alternating model. Counter examples are given to justify the various conditions required by the format.
Fil: Lee, Matías David. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina.
Fil: de Vink, Erik P. Eindhoven University of Technology; The Netherlands.
Fil: de Vink, Erik P. Centrum Wiskunde & Informatica; The Netherlands.
Ciencias de la Computación