scientific article
From MaRDI portal
Publication:3130542
DOI10.23638/LMCS-14(1:4)2018zbMath1459.68141arXiv1703.05137MaRDI QIDQ3130542
Denis Kuperberg, Anca Muscholl, Igor Walukiewicz, Javier Esparza
Publication date: 23 January 2018
Full work available at URL: https://arxiv.org/abs/1703.05137
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Cites Work
- Unnamed Item
- Soundness of workflow nets: classification, decidability, and analysis
- Negotiation as concurrency primitive
- Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Automated Synthesis of Distributed Controllers
- Notes on finite asynchronous automata
- Negotiations and Petri Nets
- On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations
- Church’s Problem and a Tour through Automata Theory
- Lectures on Concurrency and Petri Nets
Related Items (3)
Timed negotiations ⋮ A local-time semantics for negotiations ⋮ Active learning for sound negotiations
This page was built for publication:
