Diese Seite auf deutsch
SearchFormal development of algorithms
| Start date: | 01.01.1994 |
| Funded by: | Universität Augsburg |
| Local project leader: | Prof. Dr. Bernhard Möller |
| Local scientists: |
Roland Glück |
| External scientists / cooperations: |
Michel Sintzoff (Université catholique de Louvain) |
| Publications: | Publication list |
Abstract
Algebraic techniques can be used to describe and develop
algorithms. Part of the current research are graph
algorithms and some algorithms for flow problems and sorting problems.
Current research is in the area of bisimulation. Bisumulations are used for transitionsystems with infinite state space. An example are for the application of bisimulation is the development of optimal systems if single transistions are equipped with costs.
Current research is in the area of bisimulation. Bisumulations are used for transitionsystems with infinite state space. An example are for the application of bisimulation is the development of optimal systems if single transistions are equipped with costs.