Timed Negotiations - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Timed Negotiations

(1) , (2) , (2) , (1)


Negotiations were introduced in [6] as a model for concurrent systems with multiparty decisions. What is very appealing with negotiations is that it is one of the very few non-trivial concurrent models where several interesting problems, such as soundness, i.e. absence of deadlocks, can be solved in PTIME [2]. In this paper, we introduce the model of timed negotiations and consider the problem of computing the minimum and the maximum execution time of a negotiation. The latter can be solved using the algorithm of [10] computing costs in negotiations, but surprisingly minimum execution time cannot. In this paper, we propose new algorithms to compute both minimum and maximum execution time, that work in much more general classes of negotiations than [10], that only considered sound and deterministic negotiations. Further, we uncover the precise complexities of these questions, ranging from PTIME to ∆ P 2-complete. In particular, we show that computing the minimum execution time is more complex than computing the maximum execution time in most classes of negotiations we consider.
Fichier principal
Vignette du fichier
TimedNegotiations(Submitted).pdf (550.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02964695 , version 1 (12-10-2020)



Sundararaman Akshay, Blaise Genest, Loic Helouet, Sharvik Mital. Timed Negotiations. FOSSACS 2020 - 23rd International Conference on Foundations of Software Science and Computation Structures, Apr 2020, Dublin (physical conference cancelled), Ireland. pp.1-36, ⟨10.1007/978-3-030-45231-5\_3⟩. ⟨hal-02964695⟩
55 View
45 Download



Gmail Facebook Twitter LinkedIn More