|
Hokkaido University Collection of Scholarly and Academic Papers >
Theses >
博士 （情報科学） >
Scenario Verification for Proximity-Based Federation of Smart Objects Using Model Checking
|
Files in This Item:
|
|
|
Related Items in HUSCAP:
|
| Title: | Scenario Verification for Proximity-Based Federation of Smart Objects Using Model Checking |
| Other Titles: | モデル検査によるスマートオブジェクトの近接連携シナリオの形式検証 |
| Authors: | 蓑田, 玲緒奈1 Browse this author |
| Authors(alt): | Minoda, Reona1 |
| Issue Date: | 22-Mar-2018 |
| Publisher: | Hokkaido University |
| Abstract: | This thesis proposes a verification method of ubiquitous computing scenarios using model checking. Model checking is one of the most popular formal verification approach and it is often used in various fields of industry. Model checking is conducted using a Kripke structure which is a formal state transition model. In this thesis, we present following three verification frameworks for ubiquitous computing scenarios. First, we introduce a model called Context Catalytic Reaction Network (CCRN) to handle this federation model as a formal state transition model. We also give an algorithm to transform a CCRN into a Kripke structure and we conduct a case study of ubiquitous computing scenario verification, using this algorithm and the model checking. Finally, we discuss the advantages of our formal approach by showing the difficulties of our target problem experimentally. Second, we propose an efficient verification framework of CCRN as a new application field of symbolic model checking. To do so, we illustrate a method how to transform a scenario written in CCRN into a symbolic model checking problem. We also show experimentally that our framework makes it possible to verify large scale ubiquitous computing scenarios which could not be verified in realistic time by our previous method. Additionally, we show experimentally the usefulness of fault detections using bounded model checking in the same framework. Third, we propose the method of reliability analysis of ubiquitous computing scenarios. In ubiquitous computing scenarios, various devices communicate with each other through wireless network, and this kind of communications sometimes break due to external interferences. To discuss the reliability in such situation, we introduce the notion of probability into CCRN, which is a description model of ubiquitous computing scenarios. This enables us to conduct quantitative analyses such as considerations of a trade-off between the reliability of ubiquitous computing scenarios and the costs which may be necessary for their implementations. To conduct a reliability analysis of ubiquitous computing scenarios, we use the technique of probabilistic model checking. We also evaluate our method experimentally by conducting a case study using a practical example assuming a museum. |
| Conffering University: | 北海道大学 |
| Degree Report Number: | 甲第13081号 |
| Degree Level: | 博士 |
| Degree Discipline: | 情報科学 |
| Examination Committee Members: | (主査) 教授 湊 真一, 教授 有村 博紀, 准教授 瀧川 一学 |
| Degree Affiliation: | 情報科学研究科（コンピュータサイエンス専攻） |
| Type: | theses (doctoral) |
| URI: | http://hdl.handle.net/2115/70418 |
| Appears in Collections: | 課程博士 (Doctorate by way of Advanced Course) > 情報科学院(Graduate School of Information Science and Technology)
学位論文 (Theses) > 博士 （情報科学）
|
|
