A characterisation of ordered abstract probabilities

Autor: Westerbaan, Abraham, Westerbaan, B.E., Wetering, J.M.M. van de, Hermanns, H.

Publikováno v: Hermanns, H. (ed.), LICS'20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July, 2020, 944-957. New York : Association for Computing Machinery
STARTPAGE=944;ENDPAGE=957;TITLE=Hermanns, H. (ed.), LICS'20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July, 2020
Hermanns, H. (ed.), LICS'20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July, 2020, pp. 944-957
LICS

In computer science, especially when dealing with quantum computing or other non-standard models of computation, basic notions in probability theory like "a predicate" vary wildly. There seems to be one constant: the only useful example of an algebra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::276fa8cfe059a8496c4588dce7a7a8ca
http://hdl.handle.net/2066/221030

An Effect-theoretic Account of Lebesgue Integration

Autor: Jacobs, B., Westerbaan, B.E., Ghica, D.R.

Publikováno v: Ghica, D.R. (ed.), MFPS XXXI : The 31st Conference on the Mathematical Foundations of Programming Semantics, 22-25 June 2015, Nijmegen, Netherlands, pp. 239-253
Ghica, D.R. (ed.), MFPS XXXI : The 31st Conference on the Mathematical Foundations of Programming Semantics, 22-25 June 2015, Nijmegen, Netherlands, 239-253. Amsterdam : Elsevier
STARTPAGE=239;ENDPAGE=253;ISSN=1571-0661;TITLE=Ghica, D.R. (ed.), MFPS XXXI : The 31st Conference on the Mathematical Foundations of Programming Semantics, 22-25 June 2015, Nijmegen, Netherlands
MFPS

Effect algebras have been introduced in the 1990s in the study of the foundations of quantum mechanics, as part of a quantum-theoretic version of probability theory. This paper is part of that programme and gives a systematic account of Lebesgue inte

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79af2726f5eee5e6432fa9a409bab21e
https://doi.org/10.1016/j.entcs.2015.12.015

A Coalgebraic View of ε-Transitions

Autor: Silva, A., Westerbaan, B.E., Heckel, R., Milius, S.

Publikováno v: Algebra and Coalgebra in Computer Science ISBN: 9783642402050
CALCO
Lecture Notes in Computer Science ; 8089, 267-281. Berlin : Springer
STARTPAGE=267;ENDPAGE=281;TITLE=Lecture Notes in Computer Science ; 8089
Heckel, R.; Milius, S. (ed.), Algebra and coalgebra in computer science, pp. 267-281

In automata theory, a machine transitions from one state to the next when it reads an input symbol. It is common to also allow an automaton to transition without input, via an e-transition. These e-transitions are convenient, e.g., when one defines t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a56a5cd27f7f9bc7c3eaaced78f07c39
https://doi.org/10.1007/978-3-642-40206-7_20