Skip to main content
SpringerLink
Log in
Book cover

Transactions on Petri Nets and Other Models of Concurrency XI pp 203–225Cite as

Negotiations and Petri Nets

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((TOPNOC,volume 9930))

Abstract

Negotiations have recently been introduced as a model of concurrency with multi-party negotiation atoms as primitive. This paper studies the relation between negotiations and Petri nets. In particular, we show that each negotiation can be translated into a 1-safe labelled Petri net with equivalent behaviour. In the general case, this Petri net is exponentially larger than the negotiation. For deterministic negotiations, however, the corresponding Petri has linear size compared to the negotiation, and it enjoys the free-choice property. We show that for this class the negotiation is sound if and only if the corresponding Petri net is sound. Finally, we have a look at the converse direction: given a Petri net, can we find a corresponding negotiation?

This work was partially funded by the DFG Project “Negotiations: A Model for Tractable Concurrency”.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    But by no means impossible. The literature also uses far stronger primitives, like reliable broadcasts [7].

  2. 2.

    Without the second condition, i.e., assuming only that p has no output transitions, the derived net is a bisimular net. It has in particular identical occurrence sequences as the original one, but it can have a smaller reachability graph because distinct reachable markings might differ only with respect to the place p.

References

  1. van der Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circ. Syst. Comput. 08(01), 21–66 (1998)

    Article  Google Scholar 

  2. Abdelzaher, T., Atkins, E.M., Shin, K.G.: QoS negotiation in real-time systems and its application to automated flight control. IEEE Trans. Comput. 49(11), 1170–1183 (2000)

    Article  Google Scholar 

  3. Basu, S., Bultan, T., Ouederni, M.: SIGPLAN notices. POPL 2012, 47(1) (2012). issn = 0362-1340. ACM, New York

    Google Scholar 

  4. Chen, Y., Peng, Y., Finin, T., Labrou, Y., Chu, B., Yao, J., Sun, R., Willhelm, B., Cost, S.: A negotiation-based multi-agent system for supply chain management. In: Proceedings of Agents 99 - Workshop on Agent Based Decision-Support for Managing the Internet-Enabled Supply-Chain, pp. 15–20 (1999)

    Google Scholar 

  5. Davis, R., Smith, R.G.: Negotiation as a metaphor for distributed problem solving. Artif. Intell. 20(1), 63–109 (1983)

    Article  Google Scholar 

  6. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, New York (1995)

    Book  MATH  Google Scholar 

  7. Emerson, E.A., Kahlon, V.: Rapid parameterized model checking of snoopy cache coherence protocols. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 144–159. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Esparza, J., Desel, J.: On negotiation as concurrency primitive. In: D’Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 – Concurrency Theory. LNCS, vol. 8052, pp. 440–454. Springer, Heidelberg (2013). Extended version in CoRR, abs/1307.2145, http://arxiv.org/abs/1307.2145

    Google Scholar 

  9. Esparza, J., Desel, J.: On negotiation as concurrency primitive II: deterministic cyclic negotiations. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 258–273. Springer, Heidelberg (2014). Extended version in CoRR, abs/1403.4958, http://arxiv.org/abs/1403.4958

    Google Scholar 

  10. Esparza, J., Desel, J.: Negotiation programs. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 157–178. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  11. Esparza, J., Hoffmann, P.: Reduction rules for colored workflow nets. In: Stevens, P., Wasowski, A. (eds.) FASE 2016. LNCS, vol. 9633, pp. 342–358. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49665-7_20

    Chapter  Google Scholar 

  12. Genest, B., Muscholl, A., Peled, D.A.: Message sequence charts. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 537–558. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Wooldridge, M.J., Sierra, C.: Automated negotiation: prospects, methods and challenges. Group Decis. Negot. 10(2), 199–215 (2001)

    Article  Google Scholar 

  14. Peltz, C.: Web services orchestration and choreography. IEEE Comput. 36(10), 46–52 (2003). doi:10.1109/MC.2003.1236471

    Article  Google Scholar 

  15. Salaün, G., Bultan, T., Roohi, N.: Realizability of choreographies using process algebra encodings. IEEE Trans. Serv. Comput. 5(3), 290–304 (2012)

    Article  Google Scholar 

  16. Simon, C.: Negotiation Processes - The Semantic Process Language and Applications. Shaker, Aachen (2008)

    Google Scholar 

  17. Winsborough, W.H., Seamons, K.E., Jones, V.E.: Automated trust negotiation. In: DARPA Information Survivability Conference and Exposition, DISCEX 2000 Proceedings, vol. 1, pp. 88–102. IEEE (2000)

    Google Scholar 

  18. Xu, H., Shatz, S.M.: An agent-based Petri net model with application to seller/buyer design in electronic commerce. In: Fifth International Symposium on Autonomous Decentralized Systems, ISADS 2001, Dallas, Texas, USA, 26–28 March 2001, pp. 11–18. IEEE Computer Society (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik, FernUniversität in Hagen, Hagen, Germany

    Jörg Desel

  2. Fakultät für Informatik, Technische Universität München, Munich, Germany

    Javier Esparza

Authors
  1. Jörg Desel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jörg Desel .

Editor information

Editors and Affiliations

  1. Newcastle University , Newcastle upon Tyne, United Kingdom

    Maciej Koutny

  2. FernUniversität in Hagen , Hagen, Germany

    Jörg Desel

  3. Leiden University , Leiden, The Netherlands

    Jetty Kleijn

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Desel, J., Esparza, J. (2016). Negotiations and Petri Nets. In: Koutny, M., Desel, J., Kleijn, J. (eds) Transactions on Petri Nets and Other Models of Concurrency XI. Lecture Notes in Computer Science(), vol 9930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53401-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-53401-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-53400-7

  • Online ISBN: 978-3-662-53401-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation