Results 11 to 20 of about 6,849,468 (275)
Searching for $G^3$ in $t \tbar$ Production [PDF]
, 1994 20 pages, 8 figures (3 updated figures not included but available upon request), CALT-68-1941, BUHEP-94-18. (Some previously overlooked graphs are now included. Our conclusions remain unchanged.)
Cho, Peter, Simmons, Elizabeth
openaire +5 more sources
Distribution Bisimilarity via the Power of Convex Algebras [PDF]
Logical Methods in Computer Science, 2021 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 ...
Filippo Bonchi +2 more
doaj +1 more source
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions [PDF]
TheoretiCS, 2023 We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
Weiming Feng +3 more
doaj +1 more source
Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems [PDF]
Logical Methods in Computer Science, 2020 We develop a novel method to analyze the dynamics of stochastic rewriting systems evolving over finitary adhesive, extensive categories. Our formalism is based on the so-called rule algebra framework and exhibits an intimate relationship between the ...
Nicolas Behr +2 more
doaj +1 more source
Model Checking Probabilistic Timed Automata with One or Two Clocks [PDF]
Logical Methods in Computer Science, 2008 Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks.
Marcin Jurdzinski +2 more
doaj +1 more source
Rule Algebras for Adhesive Categories [PDF]
Logical Methods in Computer Science, 2020 We demonstrate that the most well-known approach to rewriting graphical structures, the Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules along an overlap that is associative in a natural sense.
Nicolas Behr, Pawel Sobocinski
doaj +1 more source
Multi-Objective Model Checking of Markov Decision Processes [PDF]
Logical Methods in Computer Science, 2008 We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (\omega -regular or LTL) properties \varphi\_i, and probabilities r\_i \epsilon [0,
Kousha Etessami +3 more
doaj +1 more source
Approximate reasoning for real-time probabilistic processes [PDF]
Logical Methods in Computer Science, 2006 We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a much broader ...
Vineet Gupta +2 more
doaj +1 more source
Recursive Concurrent Stochastic Games [PDF]
Logical Methods in Computer Science, 2008 We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games to a concurrent setting where the two players choose moves simultaneously and independently at each state.
Kousha Etessami, Mihalis Yannakakis
doaj +1 more source
Deriving Probability Density Functions from Probabilistic Functional Programs [PDF]
Logical Methods in Computer Science, 2017 The probability density function of a probability distribution is a fundamental concept in probability theory and a key ingredient in various widely used machine learning methods.
Sooraj Bhat +3 more
doaj +1 more source