Mostrar el registro sencillo del ítem
dc.contributor.author
D'argenio, Pedro Ruben
dc.contributor.author
Gebler, Daniel
dc.contributor.author
Lee, Matias David
dc.date.available
2022-04-29T13:54:42Z
dc.date.issued
2016-03
dc.identifier.citation
D'argenio, Pedro Ruben; Gebler, Daniel; Lee, Matias David; A general SOS theory for the specification of probabilistic transition systems; Academic Press Inc Elsevier Science; Information and Computation; 249; 3-2016; 76-109
dc.identifier.issn
0890-5401
dc.identifier.uri
http://hdl.handle.net/11336/156111
dc.description.abstract
This article focuses on the formalization of the structured operational semantics approach for languages with primitives that introduce probabilistic and non-deterministic behavior. We define a general theoretic framework and present the ntμfθ/ntμxθ rule format that guarantees that bisimulation equivalence (in the probabilistic setting) is a congruence for any operator defined in this format. We show that the bisimulation is fully abstract w.r.t. the ntμfθ/ntμxθ format and (possibilistic) trace equivalence in the sense that bisimulation is the coarsest congruence included in trace equivalence for any operator definable within the ntμfθ/ntμxθ format (in other words, bisimulation is the smallest congruence relation guaranteed by the format). We also provide a conservative extension theorem and show that languages that include primitives for exponentially distributed time behavior (such as IMC and Markov automata based language) fit naturally within our framework.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
Academic Press Inc Elsevier Science
dc.rights
info:eu-repo/semantics/openAccess
dc.rights.uri
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.subject
SOS
dc.subject
PROBABILISTIC TRANSITION SYSTEMS
dc.subject
BISIMULACION
dc.subject
CONGRUENCE
dc.subject
RULE FORMAT
dc.subject
FULL ABSTRACTION
dc.subject.classification
Ciencias de la Computación
dc.subject.classification
Ciencias de la Computación e Información
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.title
A general SOS theory for the specification of probabilistic transition systems
dc.type
info:eu-repo/semantics/article
dc.type
info:ar-repo/semantics/artículo
dc.type
info:eu-repo/semantics/publishedVersion
dc.date.updated
2022-04-28T14:16:11Z
dc.journal.volume
249
dc.journal.pagination
76-109
dc.journal.pais
Países Bajos
dc.journal.ciudad
Amsterdam
dc.description.fil
Fil: D'argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
dc.description.fil
Fil: Gebler, Daniel. Vrije Universiteit Amsterdam; Países Bajos
dc.description.fil
Fil: Lee, Matias David. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
dc.journal.title
Information and Computation
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.ic.2016.03.009
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0890540116000468
Archivos asociados