Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and data, and regarding the appropriateness of various alternative models. The application of such models is often an iterative process, in which the plausibilit...

Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from state space explosion. In this paper, we address probabilistic bisimulation to reduce the size of such an MDPs while preserving PCTL properties it satisfies. We discuss different interpretations of uncertainty in the models ...

In the present paper, we refine notion of partial modular metric defined by Hosseinzadeh and Parvaneh to eliminate occurrence discrepancies in non-zero self-distance triangular inequality. support this, discuss non-trivial examples. Finally, prove a common fixed-point theorem for four self-mappings space an application our result; existence solution system Volterra integral equations is discuss...

The space of elliptic modular forms of fixed weight and level can be identified with a space of intertwining operators, from a holomorphic discrete series representation of SL2(R) to a space of automorphic forms. Moreover, multiplying elliptic modular forms corresponds to a branching problem involving tensor products of holomorphic discrete series representations. In this paper, we explicitly c...

Collective Adaptive Systems (CAS) consist of a large number of interacting objects. The design of such systems requires scalable analysis tools and methods, which have necessarily to rely on some form of approximation of the system’s actual behaviour. Promising techniques are those based on mean-field approximation. The FlyFast model-checker uses an on-the-fly algorithm for bounded PCTL model-c...