Skip to Main Content
Automated Planning
book

Automated Planning

by Malik Ghallab, Dana Nau, Paolo Traverso
May 2004
Intermediate to advanced content levelIntermediate to advanced
635 pages
19h 46m
English
Morgan Kaufmann
Content preview from Automated Planning
C.5 Symbolic Model Checking 567
As another example let us check the formula AFgreen. Initially s
1
is assigned to
the variable NextStates, but at the first iteration pre-img-af returns the empty set,
then the loop terminates and the algorithm returns False.
C.5 Symbolic Model Checking
Most often, realistic models of systems need huge numbers of states. For exam-
ple, an interlocking system may have something like 10
200
states. Symbolic model
checking [99] has been devised to deal with large state spaces. It is a form of
model checking in which propositional formulas are used for the compact rep-
resentation of finite-state models, and transformations over propositional formulas
provide a basis for efficient exploration of the state space. Most often, the ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Communicate with Teams More Effectively

Communicate with Teams More Effectively

Charles Humble
How to Overcome a Power Deficit

How to Overcome a Power Deficit

Cyril Bouquet, Jean-Louis Barsoux

Publisher Resources

ISBN: 9781558608566