956 Hits in 8.1 sec

Wait-Free Solvability of Equality Negation Tasks

Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum, Michael Wagner
2019 International Symposium on Distributed Computing  
We introduce a family of tasks for n processes, as a generalization of the two process equality negation task of Lo and Hadzilacos (SICOMP 2000).  ...  We study the solvability of this task depending on those two parameters. First, we show that the task is solvable whenever k + 2 ≤ .  ...  That kind of parameters appear in the generalized symmetry breaking task [4] .  ... 
doi:10.4230/lipics.disc.2019.21 dblp:conf/wdag/GoubaultLLR19 fatcat:yfrcjr4ckbhmdkwnz4c34zg7fe

Read-Write Reductions [chapter]

Eli Gafni
2006 Lecture Notes in Computer Science  
The discovery, more than a decade ago, of the relation between Distributed-Computing (DC) and Algebraic-Topology (AT) raised the specter of requiring checking task solvability to be intimately connected  ...  We define the notion of read-write reduction between distributed tasks, and show that all interesting known read-write impossible tasks can be proven impossible via read-write reduction to a task called  ...  An assignment that resulted in [8] , where the idea of equating SB to SAT was first introduced.  ... 
doi:10.1007/11947950_38 fatcat:olegxsbqvre3hf7edfziezqycm

A dynamic epistemic logic analysis of the equality negation task [article]

Eric Goubault and Marijana Lazic and Jeremy Ledent and Sergio Rajsbaum
2019 arXiv   pre-print
In this paper we study the solvability of the equality negation task in a simple wait-free model where processes communicate by reading and writing shared variables or exchanging messages.  ...  In this task, two processes start with a private input value in the set 0,1,2, and after communicating, each one must decide a binary output value, so that the outputs of the processes are the same if  ...  Conclusion The equality negation task is known to be unsolvable in the wait-free read/write model.  ... 
arXiv:1909.03263v1 fatcat:pw62zfvkbvgmhoqtbnrk7zq24q

On Decidability of 2-process Affine Models [article]

Petr Kuznetsov, Thibault Rieutord
2020 arXiv   pre-print
The question of whether a given task is solvable in a given affine model is, in general, undecidable. In this paper, we focus on affine models defined for a system of two processes.  ...  An affine model of computation is defined as a subset of iterated immediate-snapshot runs, capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k-concurrency, and fair  ...  Introduction The question of whether a task is solvable in a wait-free manner, i.e., in the asynchronous read-write shared-memory model with no restrictions on who and when can fail, is known to be undecidable  ... 
arXiv:2008.02099v1 fatcat:kddrusffwnajtmtegyjtamcoki

A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability

Éric Goubault, Jérémy Ledent, Sergio Rajsbaum
2018 Electronic Proceedings in Theoretical Computer Science  
We thus provide a bridge between DEL and the topological theory of distributed computability, which studies task solvability in a shared memory or message passing architecture.  ...  Finally, we describe how a distributed task specification can be modeled as a DEL action model, and show that the topological invariants determine whether the task is solvable.  ...  We concentrate on the specific setting of asynchronous wait-free shared read/write memory.  ... 
doi:10.4204/eptcs.277.6 fatcat:5gwimz76zngjva54n6xqyoosw4

Weak symmetry breaking and abstract simplex paths

2015 Mathematical Structures in Computer Science  
This theorem in turn implies the solvability of the weak symmetry breaking task in the immediate snapshot wait-free model in the case when the number of processes is not a power of a prime number.  ...  Our main application is a short and structural proof of a theorem of Castañeda and Rajsbaum.  ...  At present time, the solvability of WSB in the read/write wait-free model is completely understood.  ... 
doi:10.1017/s0960129514000085 fatcat:uypfjvhzqvg2lp4jhtjzw35zaq

Hot: A concurrent automated theorem prover based on higher-order tableaux [chapter]

Karsten Konrad
1998 Lecture Notes in Computer Science  
The rst part of this paper introduces an improved variant of the calculus which closely corresponds to the proof procedure implemented in Hot.  ...  We show the usefulness of the implementation by including benchmark results for over one hundred solved problems from logic and set theory.  ...  The construction of each branch in a free-variable tableaux is an isolated task except for the global variable substitutions which are derived from choosing uni ers and linked pairs when closing a branch  ... 
doi:10.1007/bfb0055140 fatcat:tuxfckgj5bao5awpbid6rhe2ha

Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks

J. Hoffmann
2005 The Journal of Artificial Intelligence Research  
The key technique behind this progress is the use of heuristic functions based on relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty.  ...  These distinctions divide the (set of all) planning domains into a taxonomy of classes of varying h^+ topology.  ...  Acknowledgments I would like to thank Drew McDermott, Fahiem Bacchus, Maria Fox, and Derek Long for their responses to various questions concerning the definitions of/intentions behind the competition  ... 
doi:10.1613/jair.1747 fatcat:hf7tghc4mva6besx4flel2ctqu

The impossibility of boosting distributed service resilience

Paul Attie, Rachid Guerraoui, Petr Kuznetsov, Nancy Lynch, Sergio Rajsbaum
2011 Information and Computation  
failures (i.e., wait-free) using n-process consensus services resilient to n − 1 failures (wait-free).  ...  solvable for any number of failures using only 1-resilient 2-process perfect failure detectors.  ...  In particular, we show that the 2-set-consensus problem is solvable for 2n processes and 2n − 1 failures (i.e., wait-free) using n-process consensus services resilient to n − 1 failures (i.e., wait-free  ... 
doi:10.1016/j.ic.2010.07.005 fatcat:7jex5yqgpfhehbk4oilvpwzw6y

Front Matter, Table of Contents, Preface, Conference Organization

Jukka Suomela, Michael Wagner
2019 International Symposium on Distributed Computing  
Solvability of Equality Negation Tasks Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, and Taisuke Izumi . . . . . . . . . . . . 25:1-25:17 The Complexity of Symmetry Breaking in Massive Graphs Christian  ...  . . . . . . . . 19:1-19:17 Parallel Finger Search Structures Seth Gilbert and Wei Quan Lim . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20:1-20:18 Wait-Free  ...  A preliminary version of this paper appeared as "Fast Randomized Algorithms for Distributed Edge Coloring", Proceedings of the Eleventh Annual ACM Symposium Principles of Distributed Computing (PODC),  ... 
doi:10.4230/lipics.disc.2019.0 dblp:conf/wdag/X19 fatcat:a4glb5lrkzcullfuixxrkcushy

The Semantics of Package Management via Event Structures [article]

Gershom Bazerman
2021 arXiv   pre-print
In this approach, the data of a package repository is treated as a declarative specification of a nondeterministic, concurrent program.  ...  Our hope is this lays the basis for further formal study of package management in which the weight of existing tools can be brought to bear.  ...  in positive (i.e. negation-free) propositional logic.  ... 
arXiv:2107.01542v1 fatcat:hbc5yile2redlensqaxg4ryntq

Existential Length Universality

Paweł Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, Marek Szykuła, Markus Bläser, Christophe Paul
2020 Symposium on Theoretical Aspects of Computer Science  
Finally, we prove that in all these cases, the problem becomes computationally easier when the length 𝓁 is also given in binary in the input: it is polynomially solvable for a DFA, PSPACE-complete for  ...  In the case of a PDA, we show that it is recursively unsolvable, while the smallest such 𝓁 is not bounded by any computable function of the number of states.  ...  Specified-length universality is solvable in polynomial time.  ... 
doi:10.4230/lipics.stacs.2020.16 dblp:conf/stacs/GawrychowskiLRS20 fatcat:njkfak6nwzbzfjchk6sbqifiya

Dynamic controllability via Timed Game Automata

Alessandro Cimatti, Luke Hunsberger, Andrea Micheli, Roberto Posenato, Marco Roveri
2016 Acta Informatica  
Their plan-to-TGA approach deviates from the standard definition of dynamic controllability by allowing a free time-point to be scheduled instantaneously upon the observation of an uncontrollable execution  ...  However, none of them have addressed the problem of synthesizing directly executable strategies.  ...  TGA is solvable.  ... 
doi:10.1007/s00236-016-0257-2 fatcat:wxwt5gigbrd7ffoodv6gxt5wg4

Existential length universality [article]

Paweł Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, Marek Szykuła
2020 arXiv   pre-print
Finally, we prove that in all these cases, the problem becomes computationally easier when the length ℓ is also given in binary in the input: it is polynomially solvable for a DFA, PSPACE-complete for  ...  In the case of a PDA, we show that it is recursively unsolvable, while the smallest such ℓ is not bounded by any computable function of the number of states.  ...  To solve the second task, we proceed in two steps.  ... 
arXiv:1702.03961v5 fatcat:3wqz7tqjuzf4vgm3pvrjyn4gvm

A tool for health system description. Diagnosing the Polish system

Włodzimierz C. Włodarczyk
2019 Zdrowie Publiczne i Zarządzanie  
diagnostic tests and hospitalisations, shortage of time and attention devoted to patients, issues of equal treatment of patients andoftentimes -dissatisfaction with the functioning of the system.  ...  On this basis, it can be argued that a serious problem for the system is the multi-cause perception of the patients' failure to meet their health needs, long waiting times for specialist consultation,  ...  not investigated 41% All patients are treated equally, depending only on their state of health. 48% -2007 39% Treatment is free of charge. 52% -2012 35% You can easily arrange an appointment  ... 
doi:10.4467/20842627oz.19.012.11383 fatcat:u7iosh5cyndypmihee63es5rwq
« Previous Showing results 1 — 15 out of 956 results