scholarly journals Approximate solution for two stage open networks with Markov-modulated queues minimizing the state space explosion problem

2009 ◽  
Vol 223 (1) ◽  
pp. 519-533 ◽  
Author(s):  
Orhan Gemikonakli ◽  
Enver Ever ◽  
Altan Kocyigit
Author(s):  
Amanda Coles ◽  
Andrew Coles ◽  
J. Christopher Beck

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.


2021 ◽  
Vol 5 (2) ◽  
pp. 1-26
Author(s):  
João Bastos ◽  
Jeroen Voeten ◽  
Sander Stuijk ◽  
Ramon Schiffelers ◽  
Henk Corporaal

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

2022 ◽  
Vol 183 (3-4) ◽  
pp. 319-342
Author(s):  
Yann Thierry-Mieg

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.


2013 ◽  
Vol 36 (2) ◽  
pp. 908-926 ◽  
Author(s):  
Enver Ever ◽  
Orhan Gemikonakli ◽  
Altan Kocyigit ◽  
Eser Gemikonakli

2012 ◽  
Vol 232 ◽  
pp. 578-582 ◽  
Author(s):  
Dong Liu ◽  
Xiao Juan Chen ◽  
Yi Li ◽  
Zhong Wen Zhao ◽  
Xin Ming Li

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