The problem of constructing a real time computing system that has a minimum number of processors is addressed. It is necessary that the system meets the deadlines of program execution and the system reliability requirements implying that the system must tolerate both hardware and software failures. The formal statement of this problem is presented, a method for its solution using an iterative scheduling algorithm based on the method of simulated annealing is proposed, and an experimental study of the proposed algorithm is conducted.

-In this paper we present a tool to transform UML statecharts to UPPAAL automata. The tool allows one to check temporal properties against statecharts modeling a real-time system. We give the constraints on statecharts, the tool description, and the results of testing it on a well-known traffic control example.

No abstract

No abstract