2014/03/18 by Javier Esparza, Esparza, Javier, Jörg Desel +1 · 1 citation
Business, Management and Accounting · Computer Science · #Business Process Modeling and Analysis #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Multi-Agent Systems and Negotiation
paper · pdf · doi:10.48550/arxiv.1403.4958
openalex publication_date 2014/03/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We continue our study of negotations, a concurrency model with multiparty\nnegotiation as primitive. In a previous paper (arXiv:13072145) we have provided\na correct and complete set of reduction rules for sound, acyclic, and (weakly)\ndeterministic negotiations. In this paper we extend this result to all\ndeterministic negotiations, including cyclic ones. We also show that this set\nof rules allows one to decide soundness and to summarize negotiations in\npolynomial time.\n