English
Related papers

Related papers: A State-Based Characterisation of the Conflict Pre…

200 papers

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…

Systems and Control · Electrical Eng. & Systems 2021-11-24 Kuize Zhang

In the development of operational semantics of concurrent systems, a key decision concerns the adoption of a suitable notion of execution model, which basically amounts to choosing a class of partial orders according to which events are…

Formal Languages and Automata Theory · Computer Science 2024-07-19 Maciej Koutny , Lukasz Mikulski

In this paper we consider a general system of activities that can, but do not have to, occur. This system is governed by a set containing two types of constraints: precedence and response. A precedence constraint dictates that an activity…

Combinatorics · Mathematics 2025-02-21 Mark Dukes , Anton Sohn

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

Whether or not a country is at war, or experiencing escalating or deescalating levels of conflict, has massive ramifications on a country's national and foreign policy. Given a country's history of conflict, or lack thereof, future…

Partial orders are used extensively for modeling and analyzing concurrent computations. In this paper, we define two properties of partially ordered sets: width-extensibility and interleaving-consistency, and show that a partial order can…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-10-07 Himanshu Chauhan , Vijay K. Garg

This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while…

Logic in Computer Science · Computer Science 2014-09-16 Emmanuel Beffara

Modern shared memory multiprocessors permit reordering of memory operations for performance reasons. These reorderings are often a source of subtle bugs in programs written for such architectures. Traditional approaches to verify weak…

Software Engineering · Computer Science 2016-02-29 Ganesh Narayanaswamy , Saurabh Joshi , Daniel Kroening

The dynamics of networks on Heider balance theory moves toward reducing the tension by constantly reevaluating the interactions to achieve a state of balance. Conflict of interest, however, is inherent in most complex systems; frequently,…

Physics and Society · Physics 2021-02-23 Farideh Oloomi , Razieh Masoumi , Kosar Karimipour , Ali Hosseiny , G. Reza Jafari

An approach to analyse the properties of a particle system is to compare it with different processes to understand when one of them is larger than other ones. The main technique for that is coupling, which may not be easy to construct. We…

Probability · Mathematics 2011-02-22 Davide Borrello

Quantum systems exist at finite temperatures and are likely to be disordered to some level. Since applications of quantum information often rely on entanglement, we require methods which allow entanglement measures to be calculated in the…

Quantum Physics · Physics 2015-06-03 Jenny Hide

Recently, the possible existence of quantum processes with indefinite causal order has been extensively discussed, in particular using the formalism of process matrices. Here we give a new perspective on this question, by establishing a…

Understanding the origins of militarized conflict is a complex, yet important undertaking. Existing research seeks to build this understanding by considering bi-lateral relationships between entity pairs (dyadic causes) and multi-lateral…

Computation and Language · Computer Science 2021-09-28 Niklas Stoehr , Lucas Torroba Hennigen , Samin Ahbab , Robert West , Ryan Cotterell

Contract scheduling is a general technique that allows to design a system with interruptible capabilities, given an algorithm that is not necessarily interruptible. Previous work on this topic has largely assumed that the interruption is a…

Artificial Intelligence · Computer Science 2020-11-26 Spyros Angelopoulos , Shahin Kamali

Quantum correlations between parts of a composite system most clearly reveal themselves through entanglement. Designing, maintaining, and controlling entangled systems is very demanding, which raises the stakes for understanding the…

Quantum Physics · Physics 2019-08-21 Matthew A. Hunt , Igor V. Lerner , Igor V. Yurkevich , Yuval Gefen

The rise of parallel computing hardware has made it increasingly important to understand which nonlinear state space models can be efficiently parallelized. Recent advances like DEER (arXiv:2309.12252) and DeepPCR (arXiv:2309.16318) recast…

Optimization and Control · Mathematics 2026-02-10 Xavier Gonzalez , Leo Kozachkov , David M. Zoltowski , Kenneth L. Clarkson , Scott W. Linderman

In this paper we focus on concurrent processes built on synchronization by means of futures. This concept is an abstraction for processes based on a main execution thread but allowing to delay some computations. The structure of a general…

Discrete Mathematics · Computer Science 2018-03-05 Olivier Bodini , Matthieu Dien , Antoine Genitrini , Alfredo Viola

We investigate the dynamical systems modeling conflict processes between a pair of opponents. We assume that opponents are given on a common space by distributions (probability measures) having the similar or self-similar structure. Our…

Dynamical Systems · Mathematics 2016-07-06 Volodymyr Koshmanenko , Inga Verygina

Concurrent strategies based on event structures are examined from the viewpoint of 'may' and 'must' testing in traditional process calculi. In their pure form concurrent strategies fail to expose the deadlocks and divergences that can arise…

Logic in Computer Science · Computer Science 2021-08-25 Simon Castellan , Pierre Clairambault , Glynn Winskel

We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The…

Logic in Computer Science · Computer Science 2019-02-20 Yuxin Deng , Iliano Cervesato , Robert J. Simmons
‹ Prev 1 2 3 10 Next ›