TY - GEN
T1 - Development of a scheduler for hard real-time emergency medical systems over networked space in a process algebra
AU - Sujeong, U.
AU - Cho, Gihwan
AU - Lee, Moonkun
PY - 2008
Y1 - 2008
N2 - A number of formal methods have been reported to develop hard real-time emergency medical systems. However most of the methods are not practically suitable for the systems due to their exponential complexity caused by the integrated specification of the spatial and temporal properties. Further the complexity makes processes or agents in the system, i.e., patients, ambulances, doctors, hospitals, etc., more difficult to be scheduled to meet their timing requirements over the geographically distributed space. In order to reduce the complexity and the difficulty, the paper proposes a new formal method and its execution model, namely, CARDMI, and a scheduler, namely, HAP scheduler. With CARDMI, the complexity is dramatically reduced by separating structurally the spatial dimension from the temporal domain in specification and analysis. With HAP, the difficulty is automatically handled by a new hard real-time scheduling algorithm, namely, the CRA algorithm. CARDMI and HAP can make the specification and analysis of the systems more realistic and practical for industrial applications.
AB - A number of formal methods have been reported to develop hard real-time emergency medical systems. However most of the methods are not practically suitable for the systems due to their exponential complexity caused by the integrated specification of the spatial and temporal properties. Further the complexity makes processes or agents in the system, i.e., patients, ambulances, doctors, hospitals, etc., more difficult to be scheduled to meet their timing requirements over the geographically distributed space. In order to reduce the complexity and the difficulty, the paper proposes a new formal method and its execution model, namely, CARDMI, and a scheduler, namely, HAP scheduler. With CARDMI, the complexity is dramatically reduced by separating structurally the spatial dimension from the temporal domain in specification and analysis. With HAP, the difficulty is automatically handled by a new hard real-time scheduling algorithm, namely, the CRA algorithm. CARDMI and HAP can make the specification and analysis of the systems more realistic and practical for industrial applications.
KW - CARDMI
KW - Formal method
KW - SAVE
KW - Scheduler
KW - Specification
KW - TAG
UR - https://www.scopus.com/pages/publications/62649087964
M3 - Conference paper
AN - SCOPUS:62649087964
SN - 1601320663
SN - 9781601320667
T3 - Proceedings of the 2008 International Conference on Foundations of Computer Science, FCS 2008
SP - 63
EP - 69
BT - Proceedings of the 2008 International Conference on Foundations of Computer Science, FCS 2008
T2 - 2008 International Conference on Foundations of Computer Science, FCS 2008
Y2 - 14 July 2008 through 17 July 2008
ER -