Soundness in negotiations

DOI10.23638/LMCS-14(1:4)2018MaRDI QIDQ3130542zbMATH OpenFDO

Authors Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz

Publication date 23 January 2018

Full work available at URL https://arxiv.org/abs/1703.05137

zbMATH Keywords

concurrencynegotiationssoundnessverificationworkflows

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Soundness in negotiations
• Negotiation programs
• On negotiation as concurrency primitive. II: Deterministic cyclic negotiations

Cites work

• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• Automated synthesis of distributed controllers
• Church’s Problem and a Tour through Automata Theory
• Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets)
• Lectures on Concurrency and Petri Nets
• Negotiations and Petri nets
• Notes on finite asynchronous automata
• On negotiation as concurrency primitive. II: Deterministic cyclic negotiations
• Soundness in negotiations
• Soundness of workflow nets: classification, decidability, and analysis

Cited in

(8)

• Timed negotiations
• Soundness in negotiations
• scientific article; zbMATH DE number 2104616 (Why is no real title available?)
• Static analysis of deterministic negotiations
• On negotiation as concurrency primitive. II: Deterministic cyclic negotiations
• A local-time semantics for negotiations
• Active learning for sound negotiations
• The complexity of deciding reachability properties of distributed negotiation schemes

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 Q3130542)