Skip to main content
Conference ProceedingsOPEN ACCESS

On negotiation as concurrency primitive II: Deterministic cyclic negotiations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8412 LNCS 258-273
DOI: 10.1007/978-3-642-54830-7_17
14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We continue our study of negotiations, a concurrency model with multi-party negotiation as primitive. In a previous paper [7] 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. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Esparza, J., & Desel, J. (2014). On negotiation as concurrency primitive II: Deterministic cyclic negotiations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8412 LNCS, pp. 258–273). Springer Verlag. https://doi.org/10.1007/978-3-642-54830-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free