Surface registration is often performed as a two step process. A feature matching scheme is
first adopted to find a coarse initial alignment between two meshes. Subsequently, a …

In the literature devoted to the efficient solution of Continuous Time Markov Chains (CTMCs)
the notions of lump ability and reversibility have a central role. In the context of lump able …

Quantitative analysis by means of discrete-state stochastic processes is hindered by the well-
known phenomenon of state-space explosion, whereby the size of the state space may have …

Commonly used software may be inadequate for analysing multi‐state systems because of
their increasing complexity. Here, a general method of analysing the reliability of systems …

The introduction of the class of queueing networks called G-networks by Gelenbe has been
a breakthrough in the field of stochastic modeling since it has largely expanded the class of …

Time reversibility plays an important role in the analysis of continuous and discrete time
Markov chains (DTMCs). Specifically, the computation of the stationary distribution of a …

Reversible computing is a paradigm of computation that extends the standard forward-only
programming to reversible programming, so that programs can be executed both in the …

For a large Markovian model, a “product form” is an explicit description of the steady-state
behaviour which is otherwise generally untractable. Being first introduced in queueing …

Product-forms are well-known in the community of performance evaluation because they
allow the computation of the stationary state probabilities of large models that would …

In this paper we propose a new model for the analysis of systems with aging objects such as
Time-To-Live cache. We consider a model with an underlying Continuous Time Markov …