Partitioning transition relations efficiently and automatically
نویسندگان
چکیده
Multiway Decision Graphs (MDGs) have been recently proposed as an eecient representation of Extended Finite State Machines (EFSMs), suitable for automatic hardware veriication of Register Transfer Level (RTL) designs 7, 14]. We report here on the results of our research into automatic partitioning of state transition relations described using MDGs. The objective is to achieve the maximum possible performance during an abstract implicit state enumeration procedure that is at the basis of our automatic verii-cation method.
منابع مشابه
Local Graph Partitioning as a Basis for Generating Temporally-Extended Actions in Reinforcement Learning
We present a new method for automatically creating useful temporally-extended actions in reinforcement learning. Our method identifies states that lie between two densely-connected regions of the state space and generates temporally-extended actions (e.g., options) that take the agent efficiently to these states. We search for these states using graph partitioning methods on local views of the ...
متن کاملApplying partitions to infectious diseases
Due to exponential growth in biological data, partitioning is a necessity to manage data and to use it for reasoning mechanisms to deduce and infer new information automatically. Starting from a categorisation of infectious diseases, we formalise the relations of relevant partitions, such as mode of transmission, pathological process, and infectious organism, with examples for pneumonia and cho...
متن کاملA Partitioning Methodology for BDD-Based Verification
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this problem based on state space partitioning of functions as well as relations. We investigate the key questions of how to perform partitioning in reachability based verification and provide suitable algorithms. We also addre...
متن کاملNew program model for program partitioning on NUMA multiprocessor systems - Computers and Digital Techniques, IEE Proceedings-
A new program model is presented to accurately represent parallel programs for partitioning and scheduling problems. This model extends the graphic representation of the macrodataflow by considering the complex communication options supported by NUMA systems. The proposed model shows not only task precedence relations but also data sharing status. Moreover, a new partitioning method based on th...
متن کاملOptimizing Partitioning of Transition Relations by Using High-Level Information
The computation of the reachable state set is a core task of optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based on OBDDs use a partitioned representation of the transition relation to keep the OBDD-sizes manageable. This paper presents a new approach that significantly increases the quality of the partitioning of the tran...
متن کامل