Analysis of Coordination in Asynchronous Communication

该研究将扩展数据流分析的网络， 在几个有前途的方向上交流有限状态机。 如果网络由一组流方程表示， 可以用这些方程的精确解来描述。 一般来说，找到这个解决方案是一个无法决定的问题， 相反，人们可以提出并验证一个近似的解决方案， 方程 近似解是保守的。 由此可以 用于验证网络的行为是否满足一些 所需的属性，如无死锁。

This research will extend data flow analysis of networks of communicating finite state machines in several promising directions. If the network is represented by a set of flow equations, its behavior can then be described by the exact solution of these equations. Finding this solution is, in general, an undecidable question, Instead, one can propose and verify an approximate solution to the equations. The approximate solution is conservative. Thus, it can be used later to verify that the network's behavior satisfies a number of desirable properties, such as freedom from deadlocks.