Negotiation Programs

  • Javier Esparza
  • Jörg DeselEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9115)


We introduce a global specification language for distributed negotiations, a recently introduced concurrent computation model with atomic negotiations combining synchronization of participants and choice as primitive. A token game on distributed negotiations determines reachable markings which enable possible next atomic negotiations. In a deterministic distributed negotiation, each participant can always be engaged in at most one next atomic negotiation. In a sound distributed negotiation, every atomic negotiation is enabled at some reachable marking, and from every reachable marking the final marking of the distributed negotiation can be reached. We prove that our specification language has the same expressive power as sound and deterministic negotiations, i.e., every program can be implemented by an equivalent sound and deterministic negotiation and every sound and deterministic negotiation can be specified by an equivalent program, where a program and a negotiation are equivalent if they have the same Mazurkiewicz traces and thus the same concurrent runs. The translations between negotiations and programs require only linear time.


Reduction Rule Program Rule Occurrence Sequence Initial Atom Shortcut Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Esparza, J., Desel, J.: On negotiation as concurrency primitive. In: D’Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 440–454. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  2. 2.
    Esparza, J., Desel, J.: On negotiation as concurrency primitive II: deterministic cyclic negotiations. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol. 8412, pp. 258–273. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  3. 3.
    Davis, R., Smith, R.G.: Negotiation as a metaphor for distributed problem solving. Artificial Intelligence 20(1), 63–109 (1983)CrossRefGoogle Scholar
  4. 4.
    Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Wooldridge, M.J., Sierra, C.: Automated negotiation: prospects, methods and challenges. Group Decision and Negotiation 10(2), 199–215 (2001)CrossRefGoogle Scholar
  5. 5.
    Böhm, C., Jacopini, G.: Flow diagrams, turing machines and languages with only two formation rules. Commun. ACM 9(5), 366–371 (1966)zbMATHCrossRefGoogle Scholar
  6. 6.
    Harel, D.: On folk theorems. Commun. ACM 23(7), 379–389 (1980)zbMATHCrossRefGoogle Scholar
  7. 7.
    Kozen, D., Tseng, W.-L.D.: The Böhm–Jacopini theorem is false, propositionally. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol. 5133, pp. 177–192. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  8. 8.
    Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. Data Knowl. Eng. 68(9), 793–818 (2009)CrossRefGoogle Scholar
  9. 9.
    Zwiers, J.: Compositionality, Concurrency and Partial Correctness-Proof Theories for Networks of Processes, and Their Relationship. LNCS, vol. 321. Springer, Heidelberg (1989) zbMATHGoogle Scholar
  10. 10.
    van der Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circuits, Syst. and Comput. 8(1), 21–66 (1998)CrossRefGoogle Scholar
  11. 11.
    van der Aalst, W.M.P., van Hee, K.M., ter Hofstede, A.H.M., Sidorova, N., Verbeek, H.M.W., Voorhoeve, M., Wynn, M.T.: Soundness of workflow nets: classification, decidability, and analysis. Formal Asp. Comput. 23(3), 333–363 (2011)zbMATHCrossRefGoogle Scholar
  12. 12.
    Diekert, V., Rozenberg, G., Rozenburg, G.: The book of traces, vol. 15. World Scientific (1995)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Fakultät für InformatikTechnische Universität MünchenMunichGermany
  2. 2.Fakultät für Mathematik und InformatikFernUniversitätHagenGermany

Personalised recommendations