An Automata-Theoretic Approach to Constraint LTL
Authors:
- 16 December 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 121-132
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An Automata-Theoretic Approach to Constraint LTLLecture Notes in Computer Science, 2002
- Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning2002
- Flatness Is Not a Weakness2000
- Automata on Infinite Objects1990
- On the complexity of omega -automata1988
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- The temporal logic of programs1977