TY - GEN
T1 - Model checking of adaptive programs with mode-extended linear temporal logic
AU - Zhao, Yongwang
AU - Ma, Dianfu
AU - Li, Jing
AU - Li, Zhuqing
PY - 2011
Y1 - 2011
N2 - Increasingly, software needs to dynamically adapt its structure and behavior at runtime in response to changing conditions in the supporting computing, network infrastructure, and in the surrounding physical environments. By high complexity, adaptive programs are generally difficult to specify, verify, and validate. Assurance of high dependability of these programs is a great challenge. Efficiently and precisely specifying requirements and flexible model checking for adaptation are the key issues for developing dependably adaptive software. This paper introduces a formal model for adaptive programs which have different behavioral modes. We consider that adaptive programs have two behavioral level, functional behavior and adaptation. State machine is used to describe functional behavior in different modes and mode automata is proposed for adaptations. Specifications of adaptive programs are classified into three categories, local, adaptation and global properties from their different scope of dynamic adaptation. To specify and verify specifications on our model, We propose the Mode-extended Linear Temporal Logic (mLTL) and its model checking approach. mLTL extends Linear Temporal Logic (LTL) by adding mode related element and enables describing properties on different modes. Our formal model and mLTL formulae are translated to SMV language and verified in NuSMV model checker.
AB - Increasingly, software needs to dynamically adapt its structure and behavior at runtime in response to changing conditions in the supporting computing, network infrastructure, and in the surrounding physical environments. By high complexity, adaptive programs are generally difficult to specify, verify, and validate. Assurance of high dependability of these programs is a great challenge. Efficiently and precisely specifying requirements and flexible model checking for adaptation are the key issues for developing dependably adaptive software. This paper introduces a formal model for adaptive programs which have different behavioral modes. We consider that adaptive programs have two behavioral level, functional behavior and adaptation. State machine is used to describe functional behavior in different modes and mode automata is proposed for adaptations. Specifications of adaptive programs are classified into three categories, local, adaptation and global properties from their different scope of dynamic adaptation. To specify and verify specifications on our model, We propose the Mode-extended Linear Temporal Logic (mLTL) and its model checking approach. mLTL extends Linear Temporal Logic (LTL) by adding mode related element and enables describing properties on different modes. Our formal model and mLTL formulae are translated to SMV language and verified in NuSMV model checker.
KW - Autonomic Computing
KW - Dependability
KW - Dynamic Adaptation
KW - Formal Specification
KW - Verification
UR - https://www.scopus.com/pages/publications/79961130458
U2 - 10.1109/EASe.2011.13
DO - 10.1109/EASe.2011.13
M3 - 会议稿件
AN - SCOPUS:79961130458
SN - 9780769543802
T3 - Proceedings - 8th IEEE International Conference and Workshops on Engineering of Autonomic and Autonomous Systems, EASe 2011
SP - 40
EP - 48
BT - Proceedings - 8th IEEE International Conference and Workshops on Engineering of Autonomic and Autonomous Systems, EASe 2011
T2 - 8th IEEE International Conference and Workshops on Engineering of Autonomic and Autonomous Systems, EASe 2011
Y2 - 27 April 2011 through 29 April 2011
ER -