Related papers: Weakly True Concurrency and Its Logic
Counterfactual explanation generation is a powerful method for Explainable Artificial Intelligence. It can help users understand why machine learning models make specific decisions, and how to change those decisions. Evaluating the…
Mazurkiewicz traces describe concurrent behaviors of distributed systems. Trace-closed word languages, which are "linearizations" of trace languages, constitute a weaker notion of concurrency but still give us tools to investigate the…
Separation logic is a substructural logic which has proved to have numerous and fruitful applications to the verification of programs working on dynamic data structures. Recently, Barthe, Hsu and Liao have proposed a new way of giving…
We study linking attacks on communication protocols. We show that an active attacker is strictly more powerful in this setting than previously-considered passive attackers. We introduce a formal model to reason about active linkability…
Reasoning about concurrent programs executed on weak memory models is an inherently complex task. So far, existing proof calculi for weak memory models only cover safety properties. In this paper, we provide the first proof calculus for…
In this paper, we present a formal analysis of temporally sensitive counterfactual conditionals. We observe a set of key metaphysical and conceptual problems in regards to counterfactual statements and time. Bearing that in mind, we present…
Transparency is a fundamental requirement for decision making systems when these should be deployed in the real world. It is usually achieved by providing explanations of the system's behavior. A prominent and intuitive type of explanations…
Discrete-event systems usually consist of discrete states and transitions between them caused by spontaneous occurrences of labelled (aka partially-observed) events. Due to the partially-observed feature, fundamental properties therein…
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…
In this study, we study weak values from a quantum-logical viewpoint. In addition, we examine the validity of the counterfactual statements of Hardy's paradox, which are based on weak values, and we show that these statements have not been…
In this paper, we show the equivalency of weak and strong secrecy conditions for a large class of secure network coding problems. When we restrict to linear operations, we show the equivalency of "perfect secrecy and zero-error constraints"…
There is growing concern about tacit collusion using algorithmic pricing, and regulators need tools to help detect the possibility of such collusion. This paper studies how to design a hypothesis testing framework in order to decide whether…
We study a spatially homogeneous model of a market where several agents or companies compete for a wealth resource. In analogy with ecological systems the simplest case of such models shows a kind of "competitive exclusion" principle.…
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically…
In many applications, training machine learning models involves using large amounts of human-annotated data. Obtaining precise labels for the data is expensive. Instead, training with weak supervision provides a low-cost alternative. We…
Coexistence of competing species is, due to unavoidable fluctuations, always transient. In this Letter, we investigate the ultimate survival probabilities characterizing different species in cyclic competition. We show that they often obey…
Abstract. Matching logic cannot handle concurrency. We introduce concurrent matching logic (CML) to reason about fault-free partial correctness of shared-memory concurrent programs. We also present a soundness proof for concurrent matching…
Process discovery algorithms traditionally linearize events, failing to capture the inherent concurrency of real-world processes. While some techniques can handle partially ordered data, they often struggle with scalability on large event…
This expository note aims at illustrating weak convergence of probability measures from a broader view than a previously published paper. Though the results are standard for functional analysts, this approach is rarely known by…
We expand our effective framework for weak convergence of measures on the real line by showing that effective convergence in the Prokhorov metric is equivalent to effective weak convergence. In addition, we establish a framework for the…