RWTH Aachen University
Many real-time applications need to store some data in a database. It is possible to use traditional DataBase Management Systems (DBMS). Real-Time DataBase management systems (RTDBMS) are recently subject of an intensive research. Model checking algorithms and verification tools are of great concern as well. In this paper, the authors show some possibilities of using a verification tool Uppaal on some variants of priority assignment algorithms. They present some possible models of such algorithms expressed as nets of timed automata, which are a modeling language of Uppaal.