scholarly journals Symbolic and Structural Model-Checking

2022 ◽  
Vol 183 (3-4) ◽  
pp. 319-342
Author(s):  
Yann Thierry-Mieg
Keyword(s):  
Model Checking ◽  
State Space ◽  
Structural Model ◽  
The State ◽  
Force Model ◽  
Deadlock Detection ◽  
Brute Force ◽  
General Applicability ◽  
State Space Explosion ◽  
Reachability Queries

Brute-force model-checking consists in exhaustive exploration of the state-space of a Petri net, and meets the dreaded state-space explosion problem. In contrast, this paper shows how to solve model-checking problems using a combination of techniques that stay in complexity proportional to the size of the net structure rather than to the state-space size. We combine an SMT based over-approximation to prove that some behaviors are unfeasible, an under-approximation using memory-less sampling of runs to find witness traces or counter-examples, and a set of structural reduction rules that can simplify both the system and the property. This approach was able to win by a clear margin the model-checking contest 2020 for reachability queries as well as deadlock detection, thus demonstrating the practical effectiveness and general applicability of the system of rules presented in this paper.

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.

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

On Improving Model Checking of Time Petri Nets and Its Application to the Formal Verification

2021 ◽  
Vol 12 (4) ◽  
pp. 68-84
Author(s):  
Naima Jbeli ◽  
Zohra Sbai
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Formal Verification ◽  
State Space ◽  
Order Reduction ◽  
The State ◽  
Timing Constraints ◽  
Time Petri Nets ◽  
Explicit Timing ◽  
Class Graph

Time Petri nets (TPN) are successfully used in the specification and analysis of distributed systems that involve explicit timing constraints. Especially, model checking TPN is a hopeful method for the formal verification of such complex systems. For this, it is promising to lean to the construction of an optimized version of the state space. The well-known methods of state space abstraction are SCG (state class graph) and ZBG (graph based on zones). For ZBG, a symbolic state represents the real evaluations of the clocks of the TPN; it is thus possible to directly check quantitative time properties. However, this method suffers from the state space explosion. To attenuate this problem, the authors propose in this paper to combine the ZBG approach with the partial order reduction technique based on stubborn set, leading thus to the proposal of a new state space abstraction called reduced zone-based graph (RZBG). The authors show via case studies the efficiency of the RZBG which is implemented and integrated within the 〖TPN-TCTL〗_h^∆ model checking in the model checker Romeo.

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 Sequential and Parallel Algorithms for the State Space Exploration

2016 ◽  
Vol 16 (1) ◽  
pp. 3-18 ◽  
Author(s):  
Lamia Allal ◽  
Ghalem Belalem ◽  
Philippe Dhaussy ◽  
Ciprian Teodorov
Keyword(s):  
Model Checking ◽  
Parallel Algorithms ◽  
State Space ◽  
Parallel Algorithm ◽  
Space Exploration ◽  
The State ◽  
State Space Exploration

Abstract In this article, we are interested in the exploration part of model checking which consists in traversing all the possible states of a system. We propose two approaches to exploration, parallel and sequential. We present a comparison between our parallel approach and the parallel algorithm proposed in SPIN.

Dynamic Fault Trees Analysis for Importance Measures Based on Cut Sequence Set Model

2012 ◽  
Vol 232 ◽  
pp. 578-582 ◽  
Author(s):  
Dong Liu ◽  
Xiao Juan Chen ◽  
Yi Li ◽  
Zhong Wen Zhao ◽  
Xin Ming Li
Keyword(s):  
State Space ◽  
Fault Tree ◽  
The State ◽  
Time To Failure ◽  
Exponential Distributions ◽  
Fault Trees ◽  
Dynamic Behaviors ◽  
State Space Explosion ◽  
Dynamic Fault Tree ◽  
System Components

Importance Measures (IMs) for dynamic fault tree (DFT) remains widely open, for that Markov-based methodology is limited to exponential distributions as well as the state space explosion. Cut sequence describes the dynamic behaviors among components, and Cut sequence set (CSS) model provides ways to generate and calculate the probabilities of cut sequences, but it does not show how to analysis IMs using CSS model. This paper proposed a novel methodology of IMs in CSS model, including Birnbaum measure (BI), Risk Achievement Worth (RAW) and Structure Importance (SI) and an example demonstrates the superiority of the methodology. In contrast to the Markov-based methodology, the proposed methodology is combinatorial and can handle with any type of time-to-failure distributions for the system components.

Sign in / Sign up

Export Citation Format

Share Document