Abstract not found

markovian labelled transition systems as a combination of classical action-oriented transition systems and markovian processes, especially continuous time markov chains. This model allows to calculate performance measures (e.g. response times), as well as purely functional statements (e.g. occurences

. EMPA enhances the expressiveness of classical process algebras by integrating functional and performance descriptions of concurrent systems. This is achieved by offering, besides passive actions (useful for pure nondeterminism), actions whose duration is exponentially distributed as well

Markovian Process Algebra (MPA) is a process algebra enhanced with exponential timing which allows the mapping of specifications on continuous time Markov chains (CTMCs). This paper introduces a compositional approach to compute the generator matrix of the CTMC underlying a MPA specification which

autoregressions and "nite-sample inference for stationary and nonstationary autoregressive processes

Process algebras extended by a concept to present timing behaviour have been very recently proposed as a good modelling tool for the combined analysis of qualitative and quantitative system behaviour. We introduce a a process algebra including exponentially distributed time delays and a systematic

In this work we address the problem of how to use time series data to choose from a finite set of candidate discrete state spaces, where these spaces are constructed by a domain ex-pert. We formalize the notion of model selec-tion consistency in the proposed setup. We then discuss the difference between our pro-posed framework and the classical Maximum Likelihood (ML) framework, and give an ex-ample where ML fails. Afterwards, we sug-gest alternative selection criteria and show them to be weakly consistent. Finally, we test the performance of the suggested crite-ria on both simulated and real world data. 1.

. We present a testing theory for Markovian processes in order to formalize a notion of efficiency which may be useful for the analysis of soft real time systems. Our Markovian testing theory is shown to enjoy close connections with the classical testing theory of De Nicola

time reversal in Markovian process algebra

for Markovian Processes, M. Bernardo, W.R. Cleaveland, February 1999. 99-3 A Reliable Registry for the Jgroup Distributed Object Model, A. Montresor, March 1999. 99-4 Comparing the QoS of Internet Audio Mechanisms via Formal Methods, A. Aldini, M. Bernardo, R. Gorrieri, M. Roccetti, March 1999. 99-5 Group