The purpose of the paper is to show that recursive procedures can be used for implementing real time applications without harm, if a few conditions are met. These conditions ensure upper bounds for space and time requirements can be derived at compile time. Moreover they are simple enough such that many important recursive algorithms can be implemented, for example Mergesort or recursive tree traversal algorithms.
['Johann Blieberger', 'Roland Lieger']
Real-time recursive procedures