Efficient Scenario Verification for Proximity-based Federations of Smart Objects Using Symbolic Model Checking

Reona MINODA  Shin-ichi MINATO  

Publication
D - Abstracts of IEICE TRANSACTIONS on Information and Systems (Japanese Edition)   Vol.J101-D   No.3   pp.470-480
Publication Date: 2018/03/01
Online ISSN: 1881-0225
DOI: 
Type of Manuscript: Special Section PAPER (Special Section on Student Research)
Category: 
Keyword: 
ubiquitous computing,  catalytic reaction network,  formal verification,  symbolic model checking,  smart object,  

Full Text(in Japanese): FreePDF(1.1MB)


Summary: 
Verification of ubiquitous computing (UC) scenarios enables us to detect design-related faults of UC applications before we actually implement them. In this paper, we propose a verification framework of UC scenarios through symbolic model checking. We also show experimentally that our framework makes it possible to verify large scale UC 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.