On Deadlock and Fairness Decision Problems for Computations on Client-server Systems

Authors:
Ludwik Czaja
Affiliations:
(Correspd.) Institute of Informatics University of Warsaw and University of Economics and Computer Science in Warsaw. lczaja@mimuw.edu.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2011

Citing 3
Cited 1

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Distributed Systems: Concepts and Design

Distributed Systems: Concepts and Design

Properties of Languages with Catenation and Shuffle

Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek

Quantified Score

Hi-index	0.00

Visualization

Abstract

Phenomena that inherently happen in distributed computing - some types of deadlock and fairness or starvation - are examined in a client-server model. Messages travelling between clients and a server are: request for an action, permission to start it, and termination of its execution. Deadlock-prone and (un)fair behaviours are formulated for the model and equivalence of the respective formulae to formulae expressing emptiness and finiteness of some sets generated by the model is established. From these results, some answers to decision problems for the aforesaid properties are obtained. Furthermore, equivalence between the so-called strong fairness (specified by first-order formula) and weak-fairness (second-order formula) is demonstrated.