English
Related papers

Related papers: Weakly True Concurrency and Its Logic

200 papers

Contrastive learning has achieved remarkable success in learning effective representations, with supervised contrastive learning often outperforming self-supervised approaches. However, in real-world scenarios, data annotations are often…

Machine Learning · Computer Science 2025-05-29 Zi-Hao Zhou , Jun-Jie Wang , Tong Wei , Min-Ling Zhang

We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal…

Data Structures and Algorithms · Computer Science 2014-02-03 Sascha Kurz

Vaidman, in a recent article adopts the method of 'quantum weak measurements in pre- and postselected ensembles' to ascertain whether or not the chained-Zeno counterfactual computation scheme proposed by Hosten et al. is counterfactual;…

Quantum Physics · Physics 2007-05-23 Onur Hosten , Paul G. Kwiat

We develop a formal theory of the weak values with emphasis on the consistency conditions and a probabilistic interpretation in the counter-factual processes. We present the condition for the choice of the post-selected state to give a…

Quantum Physics · Physics 2010-08-19 Akio Hosoya , Yutaka Shikano

In concurrency theory, weak bisimilarity is often used to relate processes exhibiting the same observable behaviour. The probabilistic environment gives rise to several generalisations; we study the infinitary semantics, which abstracts…

Logic in Computer Science · Computer Science 2018-10-18 Nick Fischer , Rob van Glabbeek

Various concerns suggest looking for internal co-categories in categories with strong logical structure. It turns out that in any coherent category, all co-categories are co-equivalence relations.

Category Theory · Mathematics 2014-11-21 Peter LeFanu Lumsdaine

We introduce the notion of weak containment for stationary actions of a countable group and define a natural topology on the space of weak equivalence classes. We prove that Furstenberg entropy is an invariant of weak equivalence, and…

Dynamical Systems · Mathematics 2016-11-04 Peter Burton , Martino Lupini , Omer Tamuz

We theoretically prove why statistically rejecting the null hypothesis of perfect competition is challenging, known as a common problem in the literature. We also assess the finite sample performance of the conduct parameter test in…

Econometrics · Economics 2024-08-29 Yuri Matsumura , Suguru Otani

The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…

Logic in Computer Science · Computer Science 2021-09-09 Yong Wang

This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…

Statistics Theory · Mathematics 2019-06-12 Leo Pasquazzi

Many measurements at collider experiments study physics candidates that are a subset of a collision event. The presence of multiple such candidates in a given event can cause raw biases which are large compared to typical statistical…

High Energy Physics - Experiment · Physics 2019-08-22 Patrick Koppenburg

We show that there exists, in quantum theory, a close relationship between the weak value and the correlation function, which sheds new lights on the concept of the weak value.

Quantum Physics · Physics 2009-01-28 Takahiro Sagawa

Concurrent systems identify systems, either software, hardware or even biological systems, that are characterized by sets of independent actions that can be executed in any order or simultaneously. Computer scientists resort to a causal…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-03-07 Silvia Crafa , Federica Russo

The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$ , capture…

Logic in Computer Science · Computer Science 2021-07-29 Yong Wang

The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…

Logic in Computer Science · Computer Science 2021-08-24 Yong Wang

In this article we investigate the relationships between the classical notions of weakest precondition and weakest liberal precondition, and provide several results, namely that in general, weakest liberal precondition is neither stronger…

Programming Languages · Computer Science 2015-12-15 Andrew E. Santosa

Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in partial order semantics as a theoretical foundation for formal…

Logic in Computer Science · Computer Science 2015-04-02 Alex Horn , Daniel Kroening

We present a model of political competition in which an incumbent politician, may implement a costly policy to prevent a possible threat to, for example, national security or a natural disaster.

General Economics · Economics 2020-11-18 Arthur Fishman , Doron Klunover

In the past decades, weak convergence theory for stochastic processes has become a standard tool for analyzing the asymptotic properties of various statistics. Routinely, weak convergence is considered in the space of bounded functions…

Statistics Theory · Mathematics 2014-08-15 Axel Bücher , Johan Segers , Stanislav Volgushev

In this paper we review some of the main results obtained in the field of truels. A "truel" is a generalization of a duel involving three players. Depending on the rules used for chosing the players, we may distinguish between the random,…

Probability · Mathematics 2007-05-23 Pau Amengual , Raúl Toral