On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations
arXiv:1403.4958
Abstract
We continue our study of negotations, a concurrency model with multiparty negotiation as primitive. In a previous paper (arXiv:13072145) we have provided a correct and complete set of reduction rules for sound, acyclic, and (weakly) deterministic negotiations. In this paper we extend this result to all deterministic negotiations, including cyclic ones. We also show that this set of rules allows one to decide soundness and to summarize negotiations in polynomial time.
arXiv commentUnfortunately, while preparing a journal version of this contribution we have discovered that Lemma 3 is wrong. We have uploaded a preprint of the journal version to arXiv (article 1612.07912). The preprint contains a counterexample to the lemma and a corrected reduction procedure