Multi-Partite Graphs and Verification of Software Applications for Real-Time Systems
y | 22 jun 2016
Acerca de este artículo
Publicado en línea: 22 jun 2016
Páginas: 85 - 96
DOI: https://doi.org/10.1515/cait-2016-0022
Palabras clave
© by Victor Nikiforov
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
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.