Negotiation Programs
Negotiation Programs
复制标题
谈判方案
DOI：
10.1007/978-3-319-19488-2_8
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Jörg Desel
中科院分区：
文献类型：
--
作者：
Javier Esparza;Jörg Desel
我们介绍了一个全球性的规范语言的分布式谈判，最近推出的并发计算模型与原子谈判相结合的同步参与者和选择为原语。分布式谈判的令牌游戏确定可达标记，使可能的下一个原子谈判。在一个决定性的分布式协商中，每个参与者总是最多只能参与下一个原子协商。在分布式协商中，每个原子协商都在某个可达标记处启用，并且从每个可达标记可以到达分布式协商的最终标记。我们证明，我们的规范语言具有相同的表达能力的声音和确定性的谈判，即，每个程序都可以由等效的可靠和确定性协商来实现，并且每个可靠和确定性协商都可以由等效的程序来指定，其中如果程序和协商具有相同的Mazurkiewicz轨迹并且因此具有相同的并发运行，则它们是等效的。谈判和方案之间的转换只需要线性时间。
We introduce a global specification language for distributed negotiations, a recently introduced concurrent computation model with atomic negotiations combining synchronization of participants and choice as primitive. A token game on distributed negotiations determines reachable markings which enable possible next atomic negotiations. In adeterministicdistributed negotiation, each participant can always be engaged in at most one next atomic negotiation. In asounddistributed negotiation, every atomic negotiation is enabled at some reachable marking, and from every reachable marking the final marking of the distributed negotiation can be reached. We prove that our specification language has the same expressive power as sound and deterministic negotiations, i.e., every program can be implemented by an equivalent sound and deterministic negotiation and every sound and deterministic negotiation can be specified by an equivalent program, where a program and a negotiation are equivalent if they have the same Mazurkiewicz traces and thus the same concurrent runs. The translations between negotiations and programs require only linear time.
玻姆-雅可比尼定理在命题上是错误的
DOI：
10.1007/978-3-540-70594-9_11
发表时间：
2008
期刊：
SIGACT News
影响因子：
--
作者：
D. Kozen;Wei
通讯作者：
Wei