2000 character limit reached
On Negotiation as Concurrency Primitive (1307.2145v1)
Published 8 Jul 2013 in cs.LO and cs.FL
Abstract: We introduce negotiations, a model of concurrency close to Petri nets, with multiparty negotiation as primitive. We study the problems of soundness of negotiations and of, given a negotiation with possibly many steps, computing a summary, i.e., an equivalent one-step negotiation. We provide a complete set of reduction rules for sound, acyclic, weakly deterministic negotiations and show that, for deterministic negotiations, the rules compute the summary in polynomial time.