By Topic

Aggregation of Markovian Models -- An Alternating Least Squares Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Buchholz, P. ; Dept. of Comput. Sci., Tech. Univ. Dortmund, Dortmund, Germany ; Kriege, J.

To deal with the problem of state space explosion in Markovian models often compositional modeling and the aggregation of components are used. Several approximate aggregation methods exist which are usually based on heuristics. This paper presents a new aggregation approach for Markovian components which computes aggregates that minimize the difference according to some algebraically defined function which describes the difference between the component and the aggregate. If the difference becomes zero, aggregation is exact and component and aggregate are indistinguishable. Approximate aggregates are computed using an alternating least squares approach which tries to minimize the norm-wise difference between the original component and the aggregate. The approach is extended to generate bounding aggregates which allow one to compute bounds on transient or stationary quantities when the aggregate is embedded in an environment.

Published in:

Quantitative Evaluation of Systems (QEST), 2012 Ninth International Conference on

Date of Conference:

17-20 Sept. 2012