scholarly journals Handling State Space Explosion in Component-based Software Verification: A Review

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Faranak Nejati ◽  
Abdul Azim Abd. Ghani ◽  
Ng Keng Yap ◽  
Azmi Jaafar
Keyword(s):  
State Space ◽  
Software Verification ◽  
State Space Explosion

The Quantitative Assessment of Domino Effects Based on Stochastic Petri Nets

2008 ◽  
Vol 44-46 ◽  
pp. 537-544
Author(s):  
Shi Yi Bao ◽  
Jian Xin Zhu ◽  
Li J. Wang ◽  
Ning Jiang ◽  
Zeng Liang Gao
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Quantitative Assessment ◽  
Stochastic Petri Nets ◽  
Industrial Park ◽  
Domino Effect ◽  
State Space Explosion ◽  
Stochastic Petri Net ◽  
Chemical Industrial Park

The quantitative analysis of “domino” effects is one of the main aspects of hazard assessment in chemical industrial park. This paper demonstrates the application of heterogeneous stochastic Petri net modeling techniques to the quantitative assessment of the probabilities of domino effects of major accidents in chemical industrial park. First, five events are included in the domino effect models of major accidents: pool fire, explosion, boiling liquid expanding vapour explosion (BLEVE) giving rise to a fragment, jet fire and delayed explosion of a vapour cloud. Then, the domino effect models are converted into Generalized Stochastic Petri net (GSPN) in which the probability of the domino effect is calculated automatically. The Stochastic Petri nets’ models, which are state-space based ones, increase the modeling flexibility but create the state-space explosion problems. Finally, in order to alleviate the state-space explosion problems of GSPN models, this paper employs Stochastic Wellformed Net (SWN), a particular class of High-Level (colored) SPN. To conduct a case study on a chemical industrial park, the probability of domino effects of major accidents is calculated by using the GSPN model and SWN model in this paper.

scholarly journals Inductive Method for Evaluating RFID Security Protocols

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Defu Liu ◽  
Guowu Yang ◽  
Yong Huang ◽  
Jinzhao Wu
Keyword(s):  
State Space ◽  
Denial Of Service ◽  
Difficult Problem ◽  
Mathematical Induction ◽  
Security And Privacy ◽  
Inductive Method ◽  
Denial Of Service Attacks ◽  
State Space Explosion ◽  
Replay Attacks ◽  
Rfid System

Authentication protocol verification is a difficult problem. The problem of “state space explosion” has always been inevitable in the field of verification. Using inductive characteristics, we combine mathematical induction and model detection technology to solve the problem of “state space explosion” in verifying the OSK protocol and VOSK protocol of RFID system. In this paper, the security and privacy of protocols in RFID systems are studied and analysed to verify the effectiveness of the combination of mathematical induction and model detection. We design a (r,s,t)-security experiment on the basis of privacy experiments in the RFID system according to the IND-CPA security standard in cryptography, using mathematical induction to validate the OSK protocol and VOSK protocol. Finally, the following conclusions are presented. The OSK protocol cannot resist denial of service attacks or replay attacks. The VOSK protocol cannot resist denial of service attacks but can resist replay attacks. When there is no limit on communication, the OSK protocol and VOSK protocol possess (r,s,t)-privacy; that is to say they can resist denial of service attacks.

scholarly journals Efficient Temporal Planning Using Metastates

2019 ◽  
Vol 33 ◽  
pp. 7554-7561 ◽  
Author(s):  
Amanda Coles ◽  
Andrew Coles ◽  
J. Christopher Beck
Keyword(s):  
State Space ◽  
State Of The Art ◽  
The State ◽  
The Other ◽  
Temporal Constraints ◽  
State Space Explosion ◽  
Temporal Planning ◽  
State Space Search ◽  
Temporal Inconsistency

When performing temporal planning as forward state-space search, effective state memoisation is challenging. Whereas in classical planning, two states are equal if they have the same facts and variable values, in temporal planning this is not the case: as the plans that led to the two states are subject to temporal constraints, one might be extendable into at temporally valid plan, while the other might not. In this paper, we present an approach for reducing the state space explosion that arises due to having to keep many copies of the same ‘classically’ equal state – states that are classically equal are aggregated into metastates, and these are separated lazily only in the case of temporal inconsistency. Our evaluation shows that this approach, implemented in OPTIC and compared to existing state-of-the-art memoisation techniques, improves performance across a range of temporal domains.

The Strict Strong Coloring Based Graph Distribution Algorithm

2013 ◽  
Vol 4 (1) ◽  
pp. 50-66 ◽  
Author(s):  
Nousseiba Guidoum ◽  
Meriem Bensouyad ◽  
Djamel-Eddine Saïdouni
Keyword(s):  
Experimental Study ◽  
Formal Verification ◽  
State Space ◽  
Hash Function ◽  
Concurrent Systems ◽  
Dominance Relation ◽  
Basic Solution ◽  
State Space Explosion ◽  
First Time

State space explosion is a fundamental obstacle in formal verification of concurrent systems. As a solution for this problem, this paper deals with distributed state space. The authors’ solution is to introduce the coloring concept and dominance relation in graphs for finding the good distribution of given graphs. This basic solution is improved in two steps: the initialization and optimization step. The authors also report on a thorough experimental study to evaluate the performance of this new algorithm which depends strongly on the size, nature of the graphs, and the chosen number of workers. In addition, the quality of this algorithm is illustrated by comparison with the hash function (MD5) based algorithm. To the best of the authors’ knowledge, it is the first time when coloring concept is used to solve this problem.

scholarly journals Taming the State-space Explosion in the Makespan Optimization of Flexible Manufacturing Systems

2021 ◽  
Vol 5 (2) ◽  
pp. 1-26
Author(s):  
João Bastos ◽  
Jeroen Voeten ◽  
Sander Stuijk ◽  
Ramon Schiffelers ◽  
Henk Corporaal
Keyword(s):  
State Space ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
The State ◽  
State Space Explosion

scholarly journals Specification guidelines to avoid the state space explosion problem

2014 ◽  
Vol 25 (1) ◽  
pp. 4-33 ◽  
Author(s):  
Jan Friso Groote ◽  
Tim W.D.M. Kouters ◽  
Ammar Osaiweran
Keyword(s):  
State Space ◽  
The State ◽  
State Space Explosion

scholarly journals Formal Analysis of Fairness for Optimistic Multiparty Contract Signing Protocol

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Xiaoru Li ◽  
Xiaohong Li ◽  
Guangquan Xu ◽  
Jing Hu ◽  
Zhiyong Feng
Keyword(s):  
State Space ◽  
Temporal Logic ◽  
Formal Analysis ◽  
Modeling Language ◽  
Reduction Algorithm ◽  
State Reduction ◽  
State Space Explosion ◽  
Contract Signing ◽  
Time And Space Complexity ◽  
Redundant States

Optimistic multiparty contract signing (OMPCS) protocols are proposed for exchanging multiparty digital signatures in a contract. Compared with general two-party exchanging protocols, such protocols are more complicated, because the number of protocol messages and states increases considerably when signatories increase. Moreover, fairness property in such protocols requires protection from each signatory rather than from an external hostile agent. It thus presents a challenge for formal verification. In our analysis, we employ and combine the strength of extended modeling language CSP# and linear temporal logic (LTL) to verify the fairness of OMPCS protocols. Furthermore, for solving or mitigating the state space explosion problem, we set a state reduction algorithm which can decrease the redundant states properly and reduce the time and space complexity greatly. Finally, this paper illustrates the feasibility of our approach by analyzing the GM and CKS protocols, and several fairness flaws have been found in certain computation times.

Sign in / Sign up

Export Citation Format

Share Document