Skip to main content
Article thumbnail
Location of Repository

Monotone Pieces Analysis for Qualitative Modeling

By Yuhong Yan, Daniel Lemire and Martin Brooks


It is a crucial task to build qualitative models of industrial applications for model-based diagnosis. A Model Abstraction procedure is designed to automatically transform a quantitative model into qualitative model. If the data is monotone, the behavior can be easily abstracted using the corners of the bounding rectangle. Hence, many existing model abstraction approaches rely on monotonicity. But it is not a trivial problem to robustly detect monotone pieces from scattered data obtained by numerical simulation or experiments. This paper introduces an approach based on scale-dependent monotonicity: the notion that monotonicity can be defined relative to a scale. Real-valued functions defined on a finite set of reals e.g. simulation results, can be partitioned into quasi-monotone segments. The end points for the monotone segments are used as the initial set of landmarks for qualitative model abstraction. The qualitative model abstraction works as an iteratively refining process starting from the initial landmarks. The monotonicity analysis presented here can be used in constructing many other kinds of qualitative models; it is robust and computationally efficient

Topics: Artificial Intelligence
Year: 2004
OAI identifier:

Suggested articles


  1. (2003). A toolbox integrating model-based diagnosability analysis and automated generation of diagnostics’, in
  2. (2001). An online algorithm for segmenting time series’, in ICDM,
  3. (2000). and F.Hurtado, ‘Approximation of point sets by 1-corner polygonal chains’,
  4. (1994). Approximation complexity for piecewise monotone functions and real data’,
  5. (2002). Automated abstraction of numerical simulation models - theory and practical experience’,
  6. (2001). Automated qualitative abstraction and its application to automotive systems,
  7. (1992). Causality and model abstraction’,
  8. (2000). Computing contour trees in all dimensions’,
  9. (1998). Concepts of Probability Theory, Dover, 2nd edition edn.,
  10. (1969). Concepts of use in computer map processing’,
  11. (1997). Contour trees and small seed sets for isosurface traversal’,
  12. (1996). Controlled topology simplification’,
  13. (2003). Deriving qualitative deviations from matlab models’, in
  14. (1991). Fitting polygonal functions to a set of points
  15. (2001). Induction of qualitative tree’, in
  16. (1992). Interaction-based invention: designing devices from first principles’,
  17. (2004). Monotone simplification in higher dimensions’. unpublished,
  18. (2003). Near-linear time approximation algorithms for curve simplification’.
  19. (2003). Qualitative model abstraction for diagnosis’, in
  20. (1984). Qualitative process theory’,
  21. (1986). Qualitative simulation’,
  22. (2003). Simple and optimal outputsensitive computation of contour trees’,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.