同步π演算中的可行反应性
Feasible reactivity in a synchronous pi-calculus
摘要：
反应性是同步程序的一个基本属性。非正式地说，它保证了在每一个时刻，输入的程序将“反应”产生一个输出。在目前的工作中，我们考虑一个完善的财产，我们称之为“可行的反应性”。除了反应性之外，这个属性保证了在每个时刻，程序的大小和反应时间都受到计算开始时参数大小和最大输入大小的多项式的限制。我们提出了一种方法来注释程序，我们开发了相关的静态分析技术，保证可行的反应程序中表示的S-π演算。后者是基于SL同步编程模型的pi演算的同步版本。
英文摘要：
Reactivity is an essential property of a synchronous program. Informally, it guarantees that at each instant the program fed with an input will `react' producing an output. In the present work, we consider a refined property that we call ` feasible reactivity'. Beyond reactivity, this property guarantees that at each instant both the size of the program and its reaction time are bounded by a polynomial in the size of the parameters at the beginning of the computation and the size of the largest input. We propose a method to annotate programs and we develop related static analysis techniques that guarantee feasible reactivity for programs expressed in the S-pi-calculus. The latter is a synchronous version of the pi-calculus based on the SL synchronous programming model.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
