English
Related papers

Related papers: Testing Reactive Probabilistic Processes

200 papers

We study dynamic risk measures in a very general framework enabling to model uncertainty and processes with jumps. We previously showed the existence of a canonical equivalence class of probability measures hidden behind a given set of…

Probability · Mathematics 2010-12-30 Jocelyne Bion-Nadal , Magali Kervarec

There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…

Computational Complexity · Computer Science 2011-06-24 Hector Zenil , Fernando Soler-Toscano , Joost J. Joosten

Consider the sequential testing of binary outcomes. The a posteriori belief process and its objective conditional-probability counterpart generally differ but converge to the same result in well-defined tests. We show that unless the two…

Statistics Theory · Mathematics 2026-02-20 Kangda K. Wren

This paper studies a risk-sensitive decision-making problem under uncertainty. It considers a decision-making process that unfolds over a fixed number of stages, in which a decision-maker chooses among multiple alternatives, some of which…

Optimization and Control · Mathematics 2026-01-07 Chung-Han Hsieh , Yi-Shan Wong

We introduce $(\gamma,\delta)$-similarity, a notion of system comparison that measures to what extent two stable linear dynamical systems behave similarly in an input-output sense. This behavioral similarity is characterized by measuring…

Optimization and Control · Mathematics 2023-12-20 Armin Pirastehzad , Arjan van der Schaft , Bart Besselink

We analyze hypotheses tests using classical results on large deviations to compare two models, each one described by a different H\"older Gibbs probability measure. One main difference to the classical hypothesis tests in Decision Theory is…

Statistics Theory · Mathematics 2021-12-28 Hermes H. Ferreira , Artur O. Lopes , Silvia R. C. Lopes

History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some…

Formal Languages and Automata Theory · Computer Science 2026-04-01 Soumyajit Paul , David Purser , Sven Schewe , Qiyi Tang , Patrick Totzke , Di-De Yen

There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking…

Logic in Computer Science · Computer Science 2013-06-05 Nikola Beneš , Benoît Delahaye , Uli Fahrenberg , Jan Křetínský , Axel Legay

Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures…

Machine Learning · Statistics 2020-09-04 Aditya Kela , Kai von Prillwitz , Johan Aberg , Rafael Chaves , David Gross

Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In…

Formal Languages and Automata Theory · Computer Science 2017-12-04 Mathias Ruggaard Pedersen , Nathanaël Fijalkow , Giorgio Bacci , Kim Guldstrand Larsen , Radu Mardare

Many biological, psychological and economic experiments have been designed where an organism or individual must choose between two options that have the same expected reward but differ in the variance of reward received. In this way,…

Quantitative Methods · Quantitative Biology 2018-09-20 Jared M. Field , Michael B. Bonsall

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic…

Logic in Computer Science · Computer Science 2007-05-23 Ruggero Lanotte , Daniele Beauquier

We introduce a model of probabilistic verification in mechanism design. The principal elicits a message from the agent and then selects a test to give the agent. The agent's true type determines the probability with which he can pass each…

Theoretical Economics · Economics 2025-01-16 Ian Ball , Deniz Kattwinkel

Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is…

Logic in Computer Science · Computer Science 2024-01-31 Linan Chen , Florence Clerc , Prakash Panangaden

Parameter identification problems are formulated in a probabilistic language, where the randomness reflects the uncertainty about the knowledge of the true values. This setting allows conceptually easily to incorporate new information, e.g.…

Numerical Analysis · Computer Science 2013-03-19 Bojana V. Rosić , Anna Kučerová , Jan Sýkora , Oliver Pajonk , Alexander Litvinenko , Hermann G. Matthies

Recently noticed ability of restart to reduce the expected completion time of first-passage processes allows appealing opportunities for performance improvement in a variety of settings. However, complex stochastic processes often exhibit…

Statistical Mechanics · Physics 2018-02-27 Sergey Belan

A two-sample hypothesis test is a statistical procedure used to determine whether the distributions generating two samples are identical. We consider the two-sample testing problem in a new scenario where the sample measurements (or sample…

Machine Learning · Computer Science 2024-07-01 Weizhi Li , Prad Kadambi , Pouria Saidi , Karthikeyan Natesan Ramamurthy , Gautam Dasarathy , Visar Berisha

Statistical significance testing of differences in values of metrics like recall, precision and balanced F-score is a necessary part of empirical natural language processing. Unfortunately, we find in a set of experiments that many commonly…

Computation and Language · Computer Science 2007-05-23 Alexander Yeh

Equivalence testing, a fundamental problem in the field of distribution testing, seeks to infer if two unknown distributions on $[n]$ are the same or far apart in the total variation distance. Conditional sampling has emerged as a powerful…

Data Structures and Algorithms · Computer Science 2024-03-08 Diptarka Chakraborty , Sourav Chakraborty , Gunjan Kumar , Kuldeep S. Meel

Probabilistic game structures combine both nondeterminism and stochasticity, where players repeatedly take actions simultaneously to move to the next state of the concurrent game. Probabilistic alternating simulation is an important tool to…

Logic in Computer Science · Computer Science 2019-07-10 Chenyi Zhang , Jun Pang
‹ Prev 1 3 4 5 6 7 10 Next ›