Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Valeria, Vignudelli"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 2 (2022)
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the generalised powerse
Externí odkaz:
https://doaj.org/article/ffe8292ac8a5439e899a18cfb428be54
Publikováno v:
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa Israel, France. pp.1-13, ⟨10.1145/3531130.3533366⟩
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa Israel, France. pp.1-13, ⟨10.1145/3531130.3533366⟩
The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed with gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d71bb56be474d0fb859d20556245f16
https://hal.science/hal-03790273
https://hal.science/hal-03790273
Autor:
Valeria Vignudelli, Davide Sangiorgi
Publikováno v:
POPL '16
POPL '16, Jan 2016, St. Petersburg, United States. ⟨10.1145/2837614.2837651⟩
POPL
POPL '16, Jan 2016, St. Petersburg, United States. ⟨10.1145/2837614.2837651⟩
POPL
Environmental bisimulations for probabilistic higher-order languages are studied. In contrast with applicative bisimulations, environmental bisimulations are known to be more robust and do not require sophisticated techniques such as Howe’s in the
Publikováno v:
Logic in Computer Science (LICS) 2019
Logic in Computer Science (LICS) 2019, Jun 2019, Vancouver, Canada
LICS
Logic in Computer Science (LICS) 2019, Jun 2019, Vancouver, Canada
LICS
International audience; This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4ddfb8204889d1a4b308f5983e69e6b
https://hal.archives-ouvertes.fr/hal-02187093/document
https://hal.archives-ouvertes.fr/hal-02187093/document
Publikováno v:
Proc. CALCO
Publikováno v:
9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)
9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021), Aug 2021, Salzburg, Austria. ⟨10.4230/LIPIcs.CALCO.2021.11⟩
9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021), Aug 2021, Salzburg, Austria. ⟨10.4230/LIPIcs.CALCO.2021.11⟩
International audience; We prove that every finitely generated convex set of finitely supported probability distributions has a unique base. We apply this result to provide an alternative proof of a recent result: the algebraic theory of convex semil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7f34538726f4d9dc0b8cc8472556118
http://hdl.handle.net/11568/1141056
http://hdl.handle.net/11568/1141056
Autor:
Damien Pous, Valeria Vignudelli
Publikováno v:
Logic in Computer Science
Logic in Computer Science, Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209172⟩
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science-LICS 18
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science -LICS '18
LICS
Logic in Computer Science, Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209172⟩
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science-LICS 18
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science -LICS '18
LICS
International audience; Allegories were introduced by Freyd and Scedrov; they form a fragment of Tarski's calculus of relations. We show that their equational theory is decidable by characterising it in terms of a specific class of graph homomorphism
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c48c5dc5bd17342e6c0121eded4c5f94
https://hal.science/hal-01703906
https://hal.science/hal-01703906
Publikováno v:
Correct System Design. Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday
Correct System Design. Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Sep 2015, Oldenburg, Germany. ⟨10.1007/978-3-319-23506-6_7⟩
Lecture Notes in Computer Science ISBN: 9783319235059
Correct System Design
Correct System Design. Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Sep 2015, Oldenburg, Germany. ⟨10.1007/978-3-319-23506-6_7⟩
Lecture Notes in Computer Science ISBN: 9783319235059
Correct System Design
International audience; We study how applicative bisimilarity behaves when instantiated on a call-by-value probabilistic λ-calculus, endowed with Plotkin's parallel disjunction operator. We prove that congruence and coincidence with the correspondin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd72a901142eb7cd2bbb2ff315532bbb
https://hal.inria.fr/hal-01229398
https://hal.inria.fr/hal-01229398
Publikováno v:
QEST 2014
QEST 2014, Sep 2014, Florence, Italy. pp.281-296, ⟨10.1007/978-3-319-10696-0_23⟩
Quantitative Evaluation of Systems ISBN: 9783319106953
QEST
QEST 2014, Sep 2014, Florence, Italy. pp.281-296, ⟨10.1007/978-3-319-10696-0_23⟩
Quantitative Evaluation of Systems ISBN: 9783319106953
QEST
International audience; Testing equivalences have been deeply investigated on fully nondeterministic processes, as well as on processes featuring probabilities and internal nondeterminism. This is not the case with reactive probabilistic processes, f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6c1595fa821ae38a191af0fea19ed18
https://hal.inria.fr/hal-01089484
https://hal.inria.fr/hal-01089484
Publikováno v:
CSL-LICS '14
CSL-LICS '14, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603113⟩
CSL-LICS
CSL-LICS '14, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603113⟩
CSL-LICS
International audience; This paper studies the discriminating power offered by higher-order concurrent languages, and contrasts this power with those offered by higher-order sequential languages (a la lambda-calculus) and by first-order concurrent la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ef8352f3d71b33a494519bd303c5447
https://hal.inria.fr/hal-01089467
https://hal.inria.fr/hal-01089467