Soundness in negotiations
From MaRDI portal
Publication:4608664
DOI10.4230/LIPICS.CONCUR.2016.12zbMATH Open1392.68298MaRDI QIDQ4608664FDOQ4608664
Authors: Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Publication date: 21 March 2018
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (11)
- On negotiation as concurrency primitive. II: Deterministic cyclic negotiations
- Negotiation programs
- Negotiations and Petri nets
- Static analysis of deterministic negotiations
- Title not available (Why is that?)
- Defining multi-party compromises using unfoldings of workflow nets
- The complexity of deciding reachability properties of distributed negotiation schemes
- Title not available (Why is that?)
- Automated synthesis: a distributed viewpoint
- Soundness in negotiations
- Timed negotiations
This page was built for publication: Soundness in negotiations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608664)