On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations [article]

Javier Esparza, Jörg Desel
<span title="2016-12-26">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.4958v2">arXiv:1403.4958v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6u5ww5e3h5bfxkhjx5stuo4bai">fatcat:6u5ww5e3h5bfxkhjx5stuo4bai</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200930043324/https://arxiv.org/pdf/1403.4958v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e9/f8/e9f81e55033f344e34dae45a457b670d7824e73a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.4958v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>