Soundness in negotiations

Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication primitive. Well-designed negotiations must be sound, meaning that, whatever its current state, the negotiation can still be completed. In a former paper, Esparza and Desel have shown that deciding soundness of a negotiation is PSPACE-complete, and in PTIME if the negotiation is deterministic. They have also provided an algorithm for an intermediate class of acyclic, non-deterministic negotiations, but left the complexity of the soundness problem open. In the first part of this paper we study two further analysis problems for sound acyclic deterministic negotiations, called the race and the omission problem, and give polynomial algorithms. We use these results to provide the first polynomial algorithm for some analysis problems of workflow nets with data previously studied by Trcka, van der Aalst, and Sidorova. In the second part we solve the open question of Esparza and Desel's paper. We show that soundness of acyclic, weakly non-deterministic negotiations is in PTIME, and that checking soundness is already NP-complete for slightly more general classes.

Original languageEnglish
Title of host publication27th International Conference on Concurrency Theory, CONCUR 2016
EditorsJosee Desharnais, Radha Jagadeesan
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770170
StatePublished - 1 Aug 2016
Event27th International Conference on Concurrency Theory, CONCUR 2016 - Quebec City, Canada
Duration: 23 Aug 201626 Aug 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference27th International Conference on Concurrency Theory, CONCUR 2016
CityQuebec City


  • Concurrency
  • Negotiations
  • Soundness
  • Verification
  • Workflows


Dive into the research topics of 'Soundness in negotiations'. Together they form a unique fingerprint.

Cite this