Zobrazeno 1 - 10
of 125
pro vyhledávání: '"Sokolova, Ana"'
Autor:
Sokolova, Ana
Publikováno v:
EPTCS 351, 2021
MFPS conferences are dedicated to the areas of mathematics, logic, and computer science that are related to models of computation in general, and to semantics of programming languages in particular. This is a forum where researchers in mathematics an
Externí odkaz:
http://arxiv.org/abs/2112.13746
Autor:
Sokolova, Ana, Woracek, Harald
We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that each term of
Externí odkaz:
http://arxiv.org/abs/2106.06614
We prove that every finitely generated convex set of finitely supported probability distributions has a unique base, and use this result to show that the monad of convex sets of probability distributions is presented by the algebraic theory of convex
Externí odkaz:
http://arxiv.org/abs/2005.01670
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 2 (June 17, 2022) lmcs:6261
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:
http://arxiv.org/abs/1808.00923
Autor:
Arming, Sebastian, Bartocci, Ezio, Chatterjee, Krishnendu, Katoen, Joost-Pieter, Sokolova, Ana
Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to ac
Externí odkaz:
http://arxiv.org/abs/1806.05126
Autor:
Sokolova, Ana, Woracek, Harald
Esik and Maletti introduced the notion of a proper semiring and proved that some important (classes of) semirings -- Noetherian semirings, natural numbers -- are proper. Properness matters as the equivalence problem for weighted automata over a semir
Externí odkaz:
http://arxiv.org/abs/1802.07830
Autor:
Sokolova, Ana, Woracek, Harald
Publikováno v:
Logical Methods in Computer Science, Volume 14, Issue 4 (November 20, 2018) lmcs:4036
Convex algebras, also called (semi)convex sets, are at the heart of modelling probabilistic systems including probabilistic automata. Abstractly, they are the Eilenberg-Moore algebras of the finitely supported distribution monad. Concretely, they hav
Externí odkaz:
http://arxiv.org/abs/1710.10402
Publikováno v:
EPTCS 250, 2017, pp. 25-38
We study parametric Markov decision processes (PMDPs) and their reachability probabilities "independent" of the parameters. Different to existing work on parameter synthesis (implemented in the tools PARAM and PRISM), our main focus is on describing
Externí odkaz:
http://arxiv.org/abs/1707.04122
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 3 (July 23, 2021) lmcs:6158
Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition systems, combine probability and nondeterminism. They can be given different semantics, like strong bisimilarity, convex bisimilarity, or (more recently) di
Externí odkaz:
http://arxiv.org/abs/1707.02344
Symbolic model checking of parallel programs stands and falls with effective methods of dealing with the explosion of interleavings. We propose a dynamic reduction technique to avoid unnecessary interleavings. By extending Lipton's original work with
Externí odkaz:
http://arxiv.org/abs/1611.09318