Reconciling real and stochastic time: The need for probabilistic refinement

Autores
Markovski, J.; D'argenio, Pedro Ruben; Baeten, J. C. M.; De Vink, E. P.
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We conservatively extend anACP-style discrete-time process theorywith discrete stochastic delays. The semantics of the timed delays relies on time additivity and time determinism, which are properties that enable us to merge subsequent timed delays and to impose their synchronous expiration. Stochastic delays, however, interact with respect to a so-called race condition that determines the set of delays that expire first, which is guided by an (implicit) probabilistic choice. The race condition precludes the property of time additivity as the merger of stochastic delays alters this probabilistic behavior. To this end, we resolve the race condition using conditionally- distributed unit delays. We give a sound and ground-complete axiomatization of the process theory comprising the standard set of ACP-style operators. In this generalized setting, the alternative composition is no longer associative, so we have to resort to special normal forms that explicitly resolve the underlying race condition. Our treatment succeeds in the initial challenge to conservatively extend standard time with stochastic time. However, the 'dissection' of the stochastic delays to conditionally-distributed unit delays comes at a price, as we can no longer relate the resolved race condition to the original stochastic delays. We seek a solution in the field of probabilistic refinements that enable the interchange of probabilistic and non deterministic choices.
Fil: Markovski, J.. Technische Universiteit Eindhoven; Países Bajos
Fil: D'argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Baeten, J. C. M.. Technische Universiteit Eindhoven; Países Bajos. Centrum Wiskunde & Informatica; Países Bajos
Fil: De Vink, E. P.. Technische Universiteit Eindhoven; Países Bajos. Centrum Wiskunde & Informatica; Países Bajos
Materia
CONSERVATIVE EXTENSIONS
GENERALLY-DISTRIBUTED STOCHASTIC DELAYS
RACE CONDITION
TIMED AND STOCHASTIC PROCESS ALGEBRAS
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/192607

id CONICETDig_be16becb1e98ab84bd21b65a5316c183
oai_identifier_str oai:ri.conicet.gov.ar:11336/192607
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Reconciling real and stochastic time: The need for probabilistic refinementMarkovski, J.D'argenio, Pedro RubenBaeten, J. C. M.De Vink, E. P.CONSERVATIVE EXTENSIONSGENERALLY-DISTRIBUTED STOCHASTIC DELAYSRACE CONDITIONTIMED AND STOCHASTIC PROCESS ALGEBRAShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We conservatively extend anACP-style discrete-time process theorywith discrete stochastic delays. The semantics of the timed delays relies on time additivity and time determinism, which are properties that enable us to merge subsequent timed delays and to impose their synchronous expiration. Stochastic delays, however, interact with respect to a so-called race condition that determines the set of delays that expire first, which is guided by an (implicit) probabilistic choice. The race condition precludes the property of time additivity as the merger of stochastic delays alters this probabilistic behavior. To this end, we resolve the race condition using conditionally- distributed unit delays. We give a sound and ground-complete axiomatization of the process theory comprising the standard set of ACP-style operators. In this generalized setting, the alternative composition is no longer associative, so we have to resort to special normal forms that explicitly resolve the underlying race condition. Our treatment succeeds in the initial challenge to conservatively extend standard time with stochastic time. However, the 'dissection' of the stochastic delays to conditionally-distributed unit delays comes at a price, as we can no longer relate the resolved race condition to the original stochastic delays. We seek a solution in the field of probabilistic refinements that enable the interchange of probabilistic and non deterministic choices.Fil: Markovski, J.. Technische Universiteit Eindhoven; Países BajosFil: D'argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Baeten, J. C. M.. Technische Universiteit Eindhoven; Países Bajos. Centrum Wiskunde & Informatica; Países BajosFil: De Vink, E. P.. Technische Universiteit Eindhoven; Países Bajos. Centrum Wiskunde & Informatica; Países BajosAssociation for Computing Machinery2012-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/192607Markovski, J.; D'argenio, Pedro Ruben; Baeten, J. C. M.; De Vink, E. P.; Reconciling real and stochastic time: The need for probabilistic refinement; Association for Computing Machinery; Formal Aspects Of Computing; 24; 4-6; 6-2012; 497-5180934-5043CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1007/s00165-012-0230-yinfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007/s00165-012-0230-yinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T11:21:25Zoai:ri.conicet.gov.ar:11336/192607instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-22 11:21:25.862CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Reconciling real and stochastic time: The need for probabilistic refinement
title Reconciling real and stochastic time: The need for probabilistic refinement
spellingShingle Reconciling real and stochastic time: The need for probabilistic refinement
Markovski, J.
CONSERVATIVE EXTENSIONS
GENERALLY-DISTRIBUTED STOCHASTIC DELAYS
RACE CONDITION
TIMED AND STOCHASTIC PROCESS ALGEBRAS
title_short Reconciling real and stochastic time: The need for probabilistic refinement
title_full Reconciling real and stochastic time: The need for probabilistic refinement
title_fullStr Reconciling real and stochastic time: The need for probabilistic refinement
title_full_unstemmed Reconciling real and stochastic time: The need for probabilistic refinement
title_sort Reconciling real and stochastic time: The need for probabilistic refinement
dc.creator.none.fl_str_mv Markovski, J.
D'argenio, Pedro Ruben
Baeten, J. C. M.
De Vink, E. P.
author Markovski, J.
author_facet Markovski, J.
D'argenio, Pedro Ruben
Baeten, J. C. M.
De Vink, E. P.
author_role author
author2 D'argenio, Pedro Ruben
Baeten, J. C. M.
De Vink, E. P.
author2_role author
author
author
dc.subject.none.fl_str_mv CONSERVATIVE EXTENSIONS
GENERALLY-DISTRIBUTED STOCHASTIC DELAYS
RACE CONDITION
TIMED AND STOCHASTIC PROCESS ALGEBRAS
topic CONSERVATIVE EXTENSIONS
GENERALLY-DISTRIBUTED STOCHASTIC DELAYS
RACE CONDITION
TIMED AND STOCHASTIC PROCESS ALGEBRAS
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We conservatively extend anACP-style discrete-time process theorywith discrete stochastic delays. The semantics of the timed delays relies on time additivity and time determinism, which are properties that enable us to merge subsequent timed delays and to impose their synchronous expiration. Stochastic delays, however, interact with respect to a so-called race condition that determines the set of delays that expire first, which is guided by an (implicit) probabilistic choice. The race condition precludes the property of time additivity as the merger of stochastic delays alters this probabilistic behavior. To this end, we resolve the race condition using conditionally- distributed unit delays. We give a sound and ground-complete axiomatization of the process theory comprising the standard set of ACP-style operators. In this generalized setting, the alternative composition is no longer associative, so we have to resort to special normal forms that explicitly resolve the underlying race condition. Our treatment succeeds in the initial challenge to conservatively extend standard time with stochastic time. However, the 'dissection' of the stochastic delays to conditionally-distributed unit delays comes at a price, as we can no longer relate the resolved race condition to the original stochastic delays. We seek a solution in the field of probabilistic refinements that enable the interchange of probabilistic and non deterministic choices.
Fil: Markovski, J.. Technische Universiteit Eindhoven; Países Bajos
Fil: D'argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Baeten, J. C. M.. Technische Universiteit Eindhoven; Países Bajos. Centrum Wiskunde & Informatica; Países Bajos
Fil: De Vink, E. P.. Technische Universiteit Eindhoven; Países Bajos. Centrum Wiskunde & Informatica; Países Bajos
description We conservatively extend anACP-style discrete-time process theorywith discrete stochastic delays. The semantics of the timed delays relies on time additivity and time determinism, which are properties that enable us to merge subsequent timed delays and to impose their synchronous expiration. Stochastic delays, however, interact with respect to a so-called race condition that determines the set of delays that expire first, which is guided by an (implicit) probabilistic choice. The race condition precludes the property of time additivity as the merger of stochastic delays alters this probabilistic behavior. To this end, we resolve the race condition using conditionally- distributed unit delays. We give a sound and ground-complete axiomatization of the process theory comprising the standard set of ACP-style operators. In this generalized setting, the alternative composition is no longer associative, so we have to resort to special normal forms that explicitly resolve the underlying race condition. Our treatment succeeds in the initial challenge to conservatively extend standard time with stochastic time. However, the 'dissection' of the stochastic delays to conditionally-distributed unit delays comes at a price, as we can no longer relate the resolved race condition to the original stochastic delays. We seek a solution in the field of probabilistic refinements that enable the interchange of probabilistic and non deterministic choices.
publishDate 2012
dc.date.none.fl_str_mv 2012-06
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/192607
Markovski, J.; D'argenio, Pedro Ruben; Baeten, J. C. M.; De Vink, E. P.; Reconciling real and stochastic time: The need for probabilistic refinement; Association for Computing Machinery; Formal Aspects Of Computing; 24; 4-6; 6-2012; 497-518
0934-5043
CONICET Digital
CONICET
url http://hdl.handle.net/11336/192607
identifier_str_mv Markovski, J.; D'argenio, Pedro Ruben; Baeten, J. C. M.; De Vink, E. P.; Reconciling real and stochastic time: The need for probabilistic refinement; Association for Computing Machinery; Formal Aspects Of Computing; 24; 4-6; 6-2012; 497-518
0934-5043
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1007/s00165-012-0230-y
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007/s00165-012-0230-y
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Association for Computing Machinery
publisher.none.fl_str_mv Association for Computing Machinery
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846781717163016192
score 12.982451