Rooted branching bisimulation as a congruence for probabilistic transition systems

Ponencia presentada en el 13 International Workshop on Quantitative Aspects of Programming Languages and Systems. London, United Kingdom, April 11-12, 2015.

Guardado en:
Detalles Bibliográficos
Autores principales: Lee, Matías David, de Vink, Erik P.
Formato: conferenceObject
Lenguaje:Inglés
Publicado: 2022
Materias:
Acceso en línea:http://hdl.handle.net/11086/22149
Aporte de:
id I10-R141-11086-22149
record_format dspace
spelling I10-R141-11086-221492023-09-19T11:55:41Z Rooted branching bisimulation as a congruence for probabilistic transition systems Lee, Matías David de Vink, Erik P. Branching bisimulations Probabilistic transition systems Rules formats 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 2022-01-06T14:27:54Z 2022-01-06T14:27:54Z 2015 conferenceObject http://hdl.handle.net/11086/22149 eng Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ Electrónico y/o Digital ISSN: 2075-2180
institution Universidad Nacional de Córdoba
institution_str I-10
repository_str R-141
collection Repositorio Digital Universitario (UNC)
language Inglés
topic Branching bisimulations
Probabilistic transition systems
Rules formats
spellingShingle Branching bisimulations
Probabilistic transition systems
Rules formats
Lee, Matías David
de Vink, Erik P.
Rooted branching bisimulation as a congruence for probabilistic transition systems
topic_facet Branching bisimulations
Probabilistic transition systems
Rules formats
description Ponencia presentada en el 13 International Workshop on Quantitative Aspects of Programming Languages and Systems. London, United Kingdom, April 11-12, 2015.
format conferenceObject
author Lee, Matías David
de Vink, Erik P.
author_facet Lee, Matías David
de Vink, Erik P.
author_sort Lee, Matías David
title Rooted branching bisimulation as a congruence for probabilistic transition systems
title_short Rooted branching bisimulation as a congruence for probabilistic transition systems
title_full Rooted branching bisimulation as a congruence for probabilistic transition systems
title_fullStr Rooted branching bisimulation as a congruence for probabilistic transition systems
title_full_unstemmed Rooted branching bisimulation as a congruence for probabilistic transition systems
title_sort rooted branching bisimulation as a congruence for probabilistic transition systems
publishDate 2022
url http://hdl.handle.net/11086/22149
work_keys_str_mv AT leematiasdavid rootedbranchingbisimulationasacongruenceforprobabilistictransitionsystems
AT devinkerikp rootedbranchingbisimulationasacongruenceforprobabilistictransitionsystems
_version_ 1782014175715786752