Common ground to the three concepts are special polynomial sequences, called She er sequences. A polynomial sequence (sm (x))m2N0 is a sequence of polynomials sm (x) 2 K [x] such that deg sm = m, s0 6= 0. It is convenient to de ne sm = 0 for negative m. The coe cient ring K is assumed to be an integral domain. For this introduction to Finite Operator Calculus it su ces to choose K as R [!], the...

Despite the rapidly accumulating body of knowledge about protein networks, there is currently no convenient way of sharing and manipulation of such information. We suggest that a formal computer language for describing the biomolecular processes underlying protein networks is essential for rapid advancement in this field. We propose to model biomolecular processes by using the pi-Calculus, a pr...

Abstract: A key issue for distributed problem solving (DPS) systems is coordination of the agent’s actions, and methods for producing effective coordination strategies remain an active area of research. Because there are not yet approaches that can automatically produce such strategies, some human engineering is often still necessary. As a result, there is a need for a formal tool to support su...

The Pi Calculus is a popular formalism for modeling distributed computation. Session Types extend the Pi Calculus with a static, inferable type system. Dependent Types allow for a more precise characterization of the behavior of programs, but in their full generality are not inferable. In this paper, we present LiquidPi an approach that combines the dependent type inferencing of Liquid Types wi...

The way we have come to expect computer systems to behave is that we can simply add a new component to a running system and then this new component will begin to interwork with the running system without interuption of service. Describing and validating such systems of dynamic, reconngurable components presents a challenge for contemporary methods of formal description. Milner's pi-calculus goe...