|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Verifying Scenarios of Proximity-Based Federations among Smart Objects through Model Checking and Its Advantages
| Title: | Verifying Scenarios of Proximity-Based Federations among Smart Objects through Model Checking and Its Advantages |
| Authors: | Minoda, Reona Browse this author | | Minato, Shin-ichi Browse this author →KAKEN DB |
| Keywords: | ubiquitous computing | | catalytic reaction network | | formal verification | | model checking | | smart object |
| Issue Date: | Jun-2017 |
| Publisher: | 電子情報通信学会 |
| Journal Title: | IEICE transactions on information and systems |
| Volume: | E100D |
| Issue: | 6 |
| Start Page: | 1172 |
| End Page: | 1181 |
| Publisher DOI: | 10.1587/transinf.2016FOP0009 |
| Abstract: | This paper proposes a formal approach of verifying ubiquitous computing application scenarios. Ubiquitous computing application scenarios assume that there are a lot of devices and physical things with computation and communication capabilities, which are called smart objects, and these are interacted with each other. Each of these interactions among smart objects is called "federation", and these federations form a ubiquitous computing application scenario. Previously, Yuzuru Tanaka proposed "a proximity-based federation model among smart objects", which is intended for liberating ubiquitous computing from stereotyped application scenarios. However, there are still challenges to establish the verification method of this model. This paper proposes a verification method of this model through 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. We introduce a 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. |
| Rights: | Copyright ©2017 The Institute of Electronics, Information and Communication Engineers |
| Relation: | https://search.ieice.org/ |
| Type: | article |
| URI: | http://hdl.handle.net/2115/67036 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 湊 真一
|
