@InProceedings{W17,
  key    =       {W17},
  author =	 {Christoph Benzm{\"u}ller and Corrado Giromini and Andreas Nonnengart},
  title =	 {Symbolic Verification of Hybrid Systems supported by Mathematical
                  Services},
  booktitle =	 {Additonal Proceedings of 10th Symposium on the Integration of Symbolic
                  Computation and Mechanized Reasoning (CALCULEMUS 2002)},
  year =	 2002,
  pages =        {1--10},
  address =	 {Marseilles, France},
  chrisnote =	 {W17},
  abstract =	 {Verification of hybrid systems is a challenging task. Unlike many other
                  verification methods the approach proposed in [nonnengart99] avoids
                  approximations and operates directly on the original system
                  specifications. This approach, however, requires the solution of
                  non-trivial mathematical subtasks. We propose to model those kinds of
                  subtasks that are suitable for being tackled with reasoning specialists
                  as mathematical service requests to a network of service systems like
                  the MathWeb Software Bus. So far we have identified the following
                  candidates of mathematical service requests: the solution of
                  differential equations, subsumption and consistency of sets of
                  constraints. A further candidate can be the elimination of second order
                  set variables with higher order theorem provers.},
  url =		 {www.ags.uni-sb.de/~chris/papers/W17.pdf},
}