Negotiation as concurrency primitive

DOI10.1007/s00236-018-0318-9zbMath1422.68168arXiv1307.2145OpenAlexW2790828892MaRDI QIDQ1731828

Jörg Desel, Javier Esparza, Philipp H. W. Hoffmann

Publication date: 14 March 2019

Published in: Acta Informatica, CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

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

zbMATH Keywords

Petri netsnegotiationsreduction rulesstate explosion problemdeterministic negotiationsweakly deterministic acyclic negotiations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Timed negotiations ⋮ Unnamed Item ⋮ Negotiation as concurrency primitive ⋮ Unnamed Item ⋮ Automated Synthesis: a Distributed Viewpoint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of bipolar synchronization scheme
• Reduction rules for reset/inhibitor nets
• The complexity of facets (and some facets of complexity)
• Polynomial analysis algorithms for free choice probabilistic workflow nets
• Negotiation as concurrency primitive
• Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets)
• Free Choice Petri Nets
• Negotiations and Petri Nets
• On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations

This page was built for publication: Negotiation as concurrency primitive