Filters








37,022 Hits in 4.5 sec

Dynamic state space partitioning for external memory state space exploration

Sami Evangelista, Lars Michael Kristensen
2013 Science of Computer Programming  
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checking algorithms.  ...  We report on several experiments made with our verification platform ASAP that implements the dynamic partitioning scheme proposed in this paper.  ...  In the field of external memory and distributed verification, it is common to divide the state space into partitions (although some external and distributed algorithms do not rely on such a partitioning  ... 
doi:10.1016/j.scico.2011.09.005 fatcat:na3czqh6f5dprb26ew2xcfzrt4

Checking safety properties on-the-fly with the sweep-line method

Guy Edward Gallasch, Jonathan Billington, Somsak Vanit-Anunchai, Lars Michael Kristensen
2007 International Journal on Software Tools for Technology Transfer (STTT)  
CPN'09 -14 Dynamic State Space Partitioning for External Memory Model Checking CPN'09 -15 State Space Partitioning The state explosion problem can be addressed by dividing the state space into partitions  ...  Each process is responsible for exploring the states of a partition. External-memory model checking: One partition is loaded into memory at a time.  ...  Example: Partition Refinement Heuristics The refinement step requires the selection of state component to be used for the refinement.  ... 
doi:10.1007/s10009-007-0031-4 fatcat:4zx4q74c2zb2dewowqvs4v3c24

Dynamic State Space Partitioning for External Memory Model Checking [chapter]

Sami Evangelista, Lars Michael Kristensen
2009 Lecture Notes in Computer Science  
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checking algorithms.  ...  We report on several experiments made with our verification platform ASAP that implements the dynamic partitioning scheme proposed in this paper.  ...  In the field of external memory and distributed verification, it is common to divide the state space into partitions (although some external and distributed algorithms do not rely on such a partitioning  ... 
doi:10.1007/978-3-642-04570-7_7 fatcat:winxtw3id5ckhjxxalaxbkrc6y

Advanced State Space Methods [chapter]

Kurt Jensen, Lars M. Kristensen
2009 Coloured Petri Nets  
Dynamic State Space Partitioning for External Memory Model Checking. S. Evangelista and L.M. Kristensen.. In Proc. Formal Methods for Industrial Critical Systems, LNCS 5825, pp. 70-85.  ...  Each process is responsible for exploring the states of a partition. External-memory model checking: One partition is loaded into memory at a time.  ... 
doi:10.1007/b95112_8 fatcat:puynvaytqzb3rfwjac57fpvvii

Combining the Sweep-Line Method with the Use of an External-Memory Priority Queue [chapter]

Sami Evangelista, Lars Michael Kristensen
2012 Lecture Notes in Computer Science  
detection compared to a pure external memory state space exploration method.  ...  From the perspective of external memory state space exploration, we demonstrate experimentally that the state deletion performed by the sweep-line method may reduce the I/O overhead induced by duplicate  ...  For the sake of comparison, we give in Table 2 the I/O complexity of two other external memory algorithms: BFS ext , the external memory breadth-first search from [6] and PART, a state space partitioning  ... 
doi:10.1007/978-3-642-31759-0_6 fatcat:q7h725iqwjgn5lejmp6hz755ke

Architectural Leakage-Aware Management of Partitioned Scratchpad Memories

Olga Golubeva, Mirko Loghi, Massimo Poncino, Enrico Macii
2007 2007 Design, Automation & Test in Europe Conference & Exhibition  
We show that the total energy (dynamic and static) cost function yields a non-convex partitioning space, making smart exploration the only viable option; we propose an effective randomized search in the  ...  Partitioning a memory into multiple blocks that can be independently accessed is a widely used technique to reduce its dynamic power.  ...  As a consequence, the partitioning algorithms can search along "space" dimension only (the memory addresses), thus reducing the size of the search space [10] .  ... 
doi:10.1109/date.2007.364541 fatcat:qaiiagvh2vawjhc3wsd6nginpa

Distributed Verification of Multi-threaded C++ Programs

Stefan Edelkamp, Shahid Jabbar, Damian Sulewski
2008 Electronical Notes in Theoretical Computer Science  
For a distributed exploration of the state space, we report the lessons learned from using different partitioning schemes, including Holzmann and Bosnacki's [21] depth-slicing method, and their effects  ...  We exploit the concept of a signature of a state that allows the full state vector to stay on secondary memory.  ...  Experiments We implemented external exploration on top of our tool StEAM. The distributed exploration is realized through MPI.  ... 
doi:10.1016/j.entcs.2007.10.019 fatcat:6wpj767ukrerjoskgtlbkm6npu

StreamBlocks: A compiler for heterogeneous dataflow computing (technical report) [article]

Endri Bezati, Mahyar Emami, Jörn Janneck, James Larus
2021 arXiv   pre-print
StreamBlocks supports exploring the design space with a profile-guided tool that helps identify the best hardware-software partitions.  ...  A key challenge in designing these systems is partitioning computation between processors and an FPGA.  ...  ACKNOWLEDGMENTS We would like to the thank the Xilinx Adaptive Compute Clusters (XACC) university program for providing access to the ETHZ clusters to do our experimental results. J.W.  ... 
arXiv:2107.09333v1 fatcat:kw2iszud6fhyxlczkesqqeymai

ADAPTIVE VECTOR QUANTIZATION FOR REINFORCEMENT LEARNING

H.Y.K. Lau, K.L. Mak, I.S.K. Lee
2002 IFAC Proceedings Volumes  
In particular, this state-space partitioning operation is performed incrementally to reflect the experience accumulated by the agent as it explores the underlying environment. Copyright © 2002 IFAC  ...  In order to ease this problem, we propose the use of vector quantization to adaptively partition the state space based on the recent estimate of the action-value function.  ...  A memory-based technique, called prioritized sweeping, which guides the exploration of state space is discussed by Moore and Atkeson (1993) .  ... 
doi:10.3182/20020721-6-es-1901.01068 fatcat:loqttlnw3rgjpjvlasa4w5g3ha

Energy-aware memory management for embedded multidimensional signal processing applications

Florin Balasa, Noha Abuaesh, Cristian V. Gingu, Ilie I. Luican, Hongwei Zhu
2016 EURASIP Journal on Embedded Systems  
The main design target is the reduction of the static and dynamic energy consumption in the hierarchical memory subsystem.  ...  This paper presents an electronic design automation (EDA) methodology for the high-level design of hierarchical memory architectures in embedded data-intensive applications, mainly in the area of multidimensional  ...  proposed a recursive partitioning of the SPM address space, which achieved a complete exploration of the banking solutions [5] .  ... 
doi:10.1186/s13639-016-0043-9 fatcat:iclsvk37wzat3ft6qahlc6gfka

Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage [chapter]

Arnd Hartmanns, Holger Hermanns
2015 Lecture Notes in Computer Science  
It combines state space exploration based on partitioning with a block-iterative variant of value iteration over the same partitions for the analysis of probabilistic reachability and expected-reward properties  ...  The applicability of model checking is hindered by the state space explosion problem in combination with limited amounts of main memory.  ...  Acknowledgments The authors thank Christian von Essen for an inspiring discussion at TACAS 2014 about his analysis of the next-generation airborne collision avoidance system [20] : His model is an extremely  ... 
doi:10.1007/978-3-319-24953-7_10 fatcat:7y3n5ec4h5hypo4snkwlyrwv3a

Efficient Explicit-State Model Checking on General Purpose Graphics Processors [chapter]

Stefan Edelkamp, Damian Sulewski
2010 Lecture Notes in Computer Science  
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU).  ...  The proposed GPU exploration algorithm then divides into two parallel stages. In the first stage, each state is replaced with a Boolean vector to denote which transitions are enabled.  ...  In our approach storing full state information for expanding a state in RAM is optional, as the search frontier is managed on external memory.  ... 
doi:10.1007/978-3-642-16164-3_8 fatcat:tzuziwamjnghhizmbegedfm5wi

BioDiVinE: A Framework for Parallel Analysis of Biological Models

Jiří Barnat, Luboš Brim, Ivana Černá, Sven Dražan, Jana Fabriková, Jan Láník, David Šafránek, Hongwu Ma
2009 Electronic Proceedings in Theoretical Computer Science  
BioDiVinE employs techniques for finite discrete abstraction of the continuous state space. At that level, parallel analysis algorithms based on model checking are provided.  ...  We think that one of the promising directions in using the discrete abstractions for analysis of biological models is employing the model-checking-based analysis for extensive exploration of properties  ...  The current drawback of the abstraction method is strong overapproximation of non-transient states in multi-affine systems.  ... 
doi:10.4204/eptcs.6.3 fatcat:dxboa3v4anbybi4ehzaa4opcci

Anomalous diffusion in convergence to effective ergodicity [article]

Mehmet Süzen
2016 arXiv   pre-print
Modified Thirumalai-Mountain (TM) metric for magnetisation is computed for the range of temperature values under strongly correlated dynamics.  ...  In producing evolution of TM metric over time, time-averaged dynamics is generated by using Metropolis and Glauber single-spin-flip dynamics, and ensemble-averaged dynamics with an exact solution.  ...  ACKNOWLEDGEMENTS The author would like to dedicate this work for the memory of Michael Kassialos, a folk artist from Asha, Cyprus.  ... 
arXiv:1606.08693v1 fatcat:qtlvje5flrdrlb5ahvu7jfxywu

Coconut Palm: Static and Streaming Data Series Exploration Now in your Palm [article]

Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos, Themis Palpanas
2020 arXiv   pre-print
In this way, Coconut is able to leverage state-of-the-art indexing techniques that rely on sorting for the first time to build, maintain and query data series indexes using fast sequential I/Os.  ...  We highlight the rich indexing design choices that Coconut opens up, and we present a new recommender tool that allows users to intelligently navigate them for both static and streaming data exploration  ...  Coconut alleviates this pressure on main memory by relying on two-pass external sorting and log-structured updates to construct and maintain an index. Better Space vs. Time Trade-Offs.  ... 
arXiv:2006.13079v1 fatcat:3byha5rrevhmbahppiqmsn2hti
« Previous Showing results 1 — 15 out of 37,022 results