On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations

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.

[1]  K.E. Seamons,et al.  Automated trust negotiation , 2000, Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00.

[2]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[3]  N. R. Jennings,et al.  To appear in: Int Journal of Group Decision and Negotiation GDN2000 Keynote Paper Automated Negotiation: Prospects, Methods and Challenges , 2022 .

[4]  Anca Muscholl,et al.  A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms , 2004, Developments in Language Theory.

[5]  P. S. Thiagarajan,et al.  A Theory of Bipolar Synchronization Schemes , 1984, Theor. Comput. Sci..

[6]  Paul Gastin,et al.  A Kleene Theorem for Infinite Trace Languages , 1991, ICALP.

[7]  Paul Gastin,et al.  An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces , 1994, Theor. Comput. Sci..

[8]  Kang G. Shin,et al.  QoS negotiation in real-time systems and its application to automated flight control , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[9]  Moe Thandar Wynn,et al.  Soundness of workflow nets: classification, decidability, and analysis , 2011, Formal Aspects of Computing.

[10]  Haiping Xu,et al.  An agent-based Petri net model with application to seller/buyer design in electronic commerce , 2001, Proceedings 5th International Symposium on Autonomous Decentralized Systems.

[11]  Serge Haddad,et al.  A reduction theory for coloured nets , 1988, European Workshop on Applications and Theory in Petri Nets.

[12]  Jean-François Pradat-Peyre,et al.  New Efficient Petri Nets Reductions for Parallel Programs Verification , 2006, Parallel Process. Lett..

[13]  Gérard Berthelot,et al.  Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[15]  Timothy W. Finin,et al.  A negotiation-based Multi-agent System for Supply Chain Management , 1999 .

[16]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artificial Intelligence.

[17]  Jörg Desel,et al.  Negotiation as concurrency primitive , 2013, Acta Informatica.

[18]  Anca Muscholl,et al.  A Kleene theorem and model checking algorithms for existentially bounded communicating automata , 2006, Inf. Comput..

[19]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..