Title
Probabilistic Symmetry Reduction For A System With Ring Buffer
Abstract
Probabilistic model checking is an emerging technology for analyzing systems which exhibit stochastic behaviors. The verification of a larger system using probabilistic model checking faces the same state explosion problem as ordinary model checking. Probabilistic symmetry reduction is a technique to tackle this problem. In this paper, we study probabilistic symmetry reduction for a system with a ring buffer which can describe various applications. A key of probabilistic symmetry reduction is identifying symmetry of states with respect to the structure of the target system. We introduce two functions; Shift(delta) and Reverse to clarify such symmetry. Using these functions, we also present pseudo code to construct a quotient model. Then, we show two practical case studies; the one-dimensional Ising model and the Automatic Identification System (AIS). Behaviors of them were verified, but suffered from the state explosion problem. Through the case studies, we show that probabilistic symmetry reduction takes advantage of reducing the size of state space.
Year
DOI
Venue
2011
10.1587/transinf.E94.D.967
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
Keywords
Field
DocType
probabilistic symmetry reduction, ring buffer, model checking, the Ising model, AIS
Model checking,Computer science,Circular buffer,Quotient,Algorithm,Probabilistic CTL,Ising model,Statistical model,Probabilistic logic,State space
Journal
Volume
Issue
ISSN
E94D
5
1745-1361
Citations 
PageRank 
References 
0
0.34
6
Authors
4
Name
Order
Citations
PageRank
Toshifusa Sekizawa133.78
Takashi Toyoshima241.78
Koichi Takahashi3386.30
Kazuko Takahashi400.34