Multi-Partite Graphs and Verification of Software Applications for Real-Time Systems

Abstract

Aspects of static verification of software applications for real-time systems are considered. A verification method based on oriented multipartite graphs is suggested for checking whether mutual blockings (deadlocks or clinches) could occur in a real-time multitask application and estimate the duration of highpriority task blocking by lower-priority tasks due to the application structure.

Keywords

• real-time systems
• multi-task software applications
• multi-core processors
• feasibility analysis
• shared resources
• blocking factor