A translation of the π-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the π-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation f...

We propose a re-formulation of the Einstein evolution equations that cleanly separates the conformal degrees of freedom and the non-conformal degrees of freedom with the latter satisfying a first order strongly hyperbolic system. The conformal degrees of freedom are taken to be determined by the choice of slicing and the initial data, and are regarded as given functions (along with the lapse an...

We consider a linear stochastic univariate rational expectations model, with a predetermined variable, and provide alternative representations of SSEs (stationary sunspot equilibria). For a strict subset of the parameter space there exist SSEs that are locally stable under least squares learning provided agents use a common factor representation for their estimated law of motion. These results ...

In this paper, we apply a non-stationary errors-in-variables model estimation technique to a problem arising in transient electromagnetic mineral exploration. The proposed technique is used to estimate a model which is deployed for noise cancellation. Alternative methods for noise cancellation in these systems rely on specific signal characteristics, and are thus not readily transferable to oth...

Consider a system of asynchronous processes that communicate among themselves by only executing read and write operations on a set of shared variables (also known as shared registers). The system has no global clock or other synchronization primitives. Every shared variable is associated with a process (called owner) which writes it and the other processes may read it. An execution of a write (...

This paper presents novel results related to the identifiability of EIV dynamic systems based on exploiting properties of non-stationary data. We analyze single-input singleoutput systems using second order properties. Our results show that, it is possible to establish identifiability of EIV systems under mild conditions when the data is non-stationary.

In this paper it is argued that Hintikka’s game theoretical semantics for Independence Friendly logic does not formalize the intuitions about independent choices; it rather is a formalization of imperfect information. Furthermore it is shown that the logic has several strange properties (e.g. renaming of bound variables is not allowed). An alternative semantics is proposed which formalizes intu...