A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems
Mobile cyber-physical systems (CPSs) are very hard to verify, because of asynchronous communication and the arbitrary number of components. Verification via model checking typically becomes impracticable due to the state space explosion caused by the system parameters and concurrency. In this paper,...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Mobile Information Systems |
Online Access: | http://dx.doi.org/10.1155/2017/5731678 |
id |
doaj-591e27a23a334939ba7fc18214bfe6e0 |
---|---|
record_format |
Article |
spelling |
doaj-591e27a23a334939ba7fc18214bfe6e02021-07-02T04:06:09ZengHindawi LimitedMobile Information Systems1574-017X1875-905X2017-01-01201710.1155/2017/57316785731678A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical SystemsLong Zhang0Wenyan Hu1Wanxia Qu2Yang Guo3Sikun Li4College of Computer, National University of Defense Technology, Changsha, ChinaCarnegie Mellon University, Pittsburgh, PA, USACollege of Computer, National University of Defense Technology, Changsha, ChinaCollege of Computer, National University of Defense Technology, Changsha, ChinaCollege of Computer, National University of Defense Technology, Changsha, ChinaMobile cyber-physical systems (CPSs) are very hard to verify, because of asynchronous communication and the arbitrary number of components. Verification via model checking typically becomes impracticable due to the state space explosion caused by the system parameters and concurrency. In this paper, we propose a formal approach to verify the safety properties of parameterized protocols in mobile CPS. By using counter abstraction, the protocol is modeled as a Petri net. Then, a novel algorithm, which uses IC3 (the state-of-the-art model checking algorithm) as the back-end engine, is presented to verify the Petri net model. The experimental results show that our new approach can greatly scale the verification capabilities compared favorably against several recently published approaches. In addition to solving the instances fast, our method is significant for its lower memory consumption.http://dx.doi.org/10.1155/2017/5731678 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Long Zhang Wenyan Hu Wanxia Qu Yang Guo Sikun Li |
spellingShingle |
Long Zhang Wenyan Hu Wanxia Qu Yang Guo Sikun Li A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems Mobile Information Systems |
author_facet |
Long Zhang Wenyan Hu Wanxia Qu Yang Guo Sikun Li |
author_sort |
Long Zhang |
title |
A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems |
title_short |
A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems |
title_full |
A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems |
title_fullStr |
A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems |
title_full_unstemmed |
A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems |
title_sort |
formal approach to verify parameterized protocols in mobile cyber-physical systems |
publisher |
Hindawi Limited |
series |
Mobile Information Systems |
issn |
1574-017X 1875-905X |
publishDate |
2017-01-01 |
description |
Mobile cyber-physical systems (CPSs) are very hard to verify, because of asynchronous communication and the arbitrary number of components. Verification via model checking typically becomes impracticable due to the state space explosion caused by the system parameters and concurrency. In this paper, we propose a formal approach to verify the safety properties of parameterized protocols in mobile CPS. By using counter abstraction, the protocol is modeled as a Petri net. Then, a novel algorithm, which uses IC3 (the state-of-the-art model checking algorithm) as the back-end engine, is presented to verify the Petri net model. The experimental results show that our new approach can greatly scale the verification capabilities compared favorably against several recently published approaches. In addition to solving the instances fast, our method is significant for its lower memory consumption. |
url |
http://dx.doi.org/10.1155/2017/5731678 |
work_keys_str_mv |
AT longzhang aformalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT wenyanhu aformalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT wanxiaqu aformalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT yangguo aformalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT sikunli aformalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT longzhang formalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT wenyanhu formalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT wanxiaqu formalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT yangguo formalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems AT sikunli formalapproachtoverifyparameterizedprotocolsinmobilecyberphysicalsystems |
_version_ |
1721340678988890112 |