Quantitative testing semantics for non-interleaving - Computer Science > Logic in Computer ScienceReportar como inadecuado




Quantitative testing semantics for non-interleaving - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: This paper presents a non-interleaving denotational semantics for the?-calculus. The basic idea is to define a notion of test where the outcome isnot only whether a given process passes a given test, but also in how manydifferent ways it can pass it. More abstractly, the set of possible outcomesfor tests forms a semiring, and the set of process interpretations appears as amodule over this semiring, in which basic syntactic constructs are affineoperators. This notion of test leads to a trace semantics in which traces arepartial orders, in the style of Mazurkiewicz traces, extended with readinessinformation. Our construction has standard may- and must-testing as specialcases.



Autor: Emmanuel Beffara IML

Fuente: https://arxiv.org/







Documentos relacionados