Generalized Probabilistic Logic (GPL) is a temporal logic, based on the modal mu-calculus, for specifying properties of reactive probabilistic systems. GPL is expressive enough that termination of Recursive Markov Chains (RMCs) can be cast as a model checking problem over GPL. In this paper, we explore XPL, an extension to GPL for expressing properties of transition systems with probabilistic a...

Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Previous investigations indicate that humans do not tend to ascribe recursive thinking to others. Several multiagent decisionmaking frameworks such as RMM, I-POMDP and the theory of mind model recursive reasoning as integral to an agent’s rational ...

Aiming at the characteristics which variable air volume air conditioning system is multi-variable, nonlinear and uncertain system, normal fuzzy neural network is hard to meet the requirements which dynamic control of multi-variable. In this paper, we put forward a recursive neural network predictive control strategy based on wavelet neural network model. Through recursive wavelet neural network...

This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is used to represent irregular (recursive) data layouts. The distributed set abstraction is used to transparently distribute large data across multiple address spaces. We effectively map data to processors by using using ...

A recursive in time Wiener chaos representation of the optimal nonlinear filter is derived for a continuous time diffusion model with uncorrelated noises. The existing representations are either not recursive or require a prior computation of the unnormalized filtering density, which is time consuming. An algorithm is developed for computing a recursive approximation of the filter, and the erro...

We introduce recursive corona graphs as a model of small-world networks. We investigate analytically the critical characteristics of the model, including order and size, degree distribution, average path length, clustering coefficient, and the number of spanning trees, as well as Kirchhoff index. Furthermore, we study the spectra for the adjacency matrix and the Laplacian matrix for the model. ...

Models of normal open induction are those normal discretely ordered rings whose nonnegative part satisfy Peano’s axioms for open formulas in the language of ordered semirings. (Where normal means integrally closed in its fraction field.) In 1964 Shepherdson gave a recursive nonstandard model of open induction. His model is not normal and does not have any infinite prime elements. In this paper ...

Polymorphic stream functions operate on the structure of streams, infinite lists of elements, without inspection of the contained data. We prove that a simple system for specifying recursive stream functions, consisting of equations using only stream constructors and destructors and recursive calls, is already enough to define all computable polymorphic stream functions. Requiring an entirely d...

The Propositional Statechart language described in [4] makes it possible to provide unambiguous joint diagrammatic specifications of complex recursive interaction protocols such as the multilateral voting protocol. Recursive protocols described using Propositional Statecharts are not necessarily finite state, meaning that verification of properties of these protocols cannot be achieved solely b...