@book{97fb53c32b944cc285eeb81d0f760987,
title = "Greedy Model Checking",
abstract = "We present a model checking method which greedily explores the state space. Using ideas similar to greedy satisfiability checking, our method tries to fit a path to match a temporal specification. The advantages of this method is that we do not need any quantifications, we do not calculate a reachable (neither forward nor backward) set of states, and the memory requirements are quite small.",
keywords = "Model Checking, Greedy Algorithms, Temporal Specification, State Space Exploration, Memory Optimization",
author = "Williams, \{Poul Frederick\} and Antoine Rauzy",
year = "2000",
month = oct,
language = "English",
series = "IT University Technical Report Series",
number = "TR-2000-2",
publisher = "IT-Universitetet i K{\o}benhavn",
address = "Denmark",
edition = "TR-2000-2",
}