Automata-Theoretic Approach to Planning for Temporally Extended Goals
- 1 January 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 226-238
- https://doi.org/10.1007/10720246_18
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Planning control rules for reactive agentsArtificial Intelligence, 1997
- Fast planning through planning graph analysisArtificial Intelligence, 1997
- Planning via model checking: A decision procedure for ARLecture Notes in Computer Science, 1997
- On the complexity of verifying concurrent transition systemsLecture Notes in Computer Science, 1997
- COSPANLecture Notes in Computer Science, 1996
- Tutorial: Proving properties of concurrent systems with SPINLecture Notes in Computer Science, 1995
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Temporal and Modal LogicPublished by Elsevier ,1990
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971