Extended beam search for non-exhaustive state space analysis
From MaRDI portal
(Redirected from Publication:652163)
Recommendations
Cites work
- scientific article; zbMATH DE number 1701758 (Why is no real title available?)
- scientific article; zbMATH DE number 1701774 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 1237865 (Why is no real title available?)
- scientific article; zbMATH DE number 1012604 (Why is no real title available?)
- scientific article; zbMATH DE number 1982194 (Why is no real title available?)
- scientific article; zbMATH DE number 2080054 (Why is no real title available?)
- scientific article; zbMATH DE number 1538051 (Why is no real title available?)
- scientific article; zbMATH DE number 1746648 (Why is no real title available?)
- scientific article; zbMATH DE number 1753149 (Why is no real title available?)
- scientific article; zbMATH DE number 1796138 (Why is no real title available?)
- scientific article; zbMATH DE number 194622 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 3099224 (Why is no real title available?)
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- A note on two problems in connexion with graphs
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- Depth-first iterative-deepening: An optimal admissible tree search
- Distributed Extended Beam Search for Quantitative Model Checking
- Efficient on-the-fly model-checking for regular alternation-free -calculus
- Falsification of LTL Safety Properties in Hybrid Systems
- Formal Methods for the Design of Real-Time Systems
- Formal Modeling and Analysis of Timed Systems
- Foundations of Software Science and Computational Structures
- Heuristic search viewed as path finding in a graph
- Hierarchical Adaptive State Space Caching Based on Level Sampling
- Improved lower bounds for the early/tardy scheduling problem with no idle time
- Job shop scheduling with beam search
- KBFS: K-Best-First Search
- Lectures on Formal methods and performance analysis. 1st EEF/Euro summer school on trends in computer science, Berg en Dal, the Netherlands, July 3--7, 2000. Revised lectures
- Linear-space best-first search
- Model Checking Software
- Multi-objective Model Checking of Markov Decision Processes
- Pruning State Spaces with Extended Beam Search
- State-Space Search
- Survey on Directed Model Checking
- The Single Machine Early/Tardy Problem
Cited in
(5)
This page was built for publication: Extended beam search for non-exhaustive state space analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652163)