Extended beam search for non-exhaustive state space analysis
type: Item
instance of: scholarly article
title: Extended beam search for non-exhaustive state space analysis
zbMATH Open document ID: 1269.68048
author: M. Dashti
author: Anton Wijs
published in: The Journal of Logic and Algebraic Programming
publication date: 2011-12-19T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5990141
zbMATH Keywords: model checking
zbMATH Keywords: formal analysis
zbMATH Keywords: state space generation
zbMATH Keywords: heuristics
zbMATH Keywords: guided traversal
describes a project that uses: SPIN
describes a project that uses: Uppaal
describes a project that uses: LTSmin
describes a project that uses: mCRL2
describes a project that uses: mCRL
MaRDI profile type: Publication
full work available at URL: j.jlap.2011.06.002
OpenAlex ID: W2123777643
cites work: Formal Modeling and Analysis of Timed Systems
cites work: Q4533359
cites work: Formal Methods for the Design of Real-Time Systems
cites work: Q2769586
cites work: Q4551157
cites work: 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
cites work: Q2769607
cites work: Q4518908
cites work: A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
cites work: A note on two problems in connexion with graphs
cites work: Q4530808
cites work: Survey on Directed Model Checking
cites work: Multi-objective Model Checking of Markov Decision Processes
cites work: KBFS: K-Best-First Search
cites work: Q4692609
cites work: Q4472244
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Linear-space best-first search
cites work: Model Checking Software
cites work: Foundations of Software Science and Computational Structures
cites work: Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
cites work: Hierarchical Adaptive State Space Caching Based on Level Sampling
cites work: Q4337610
cites work: Q3525910
cites work: Falsification of LTL Safety Properties in Hybrid Systems
cites work: Heuristic search viewed as path finding in a graph
cites work: Q5839903
cites work: Q4224292
cites work: Q4843187
cites work: Q4426363
cites work: Job shop scheduling with beam search
cites work: The Single Machine Early/Tardy Problem
cites work: Pruning State Spaces with Extended Beam Search
cites work: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
cites work: Improved lower bounds for the early/tardy scheduling problem with no idle time
cites work: Distributed Extended Beam Search for Quantitative Model Checking
cites work: State-Space Search
DOI: 10.1016/J.JLAP.2011.06.002
description: scientific article; zbMATH DE number 5990141