Optimal Complexity Bounds for Positive LTL Games
Authors:
- 2 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 262-275
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Deterministic generators and games for LTL fragments2002
- The complexity of propositional linear temporal logics in simple casesLecture Notes in Computer Science, 1998
- Higher Order Logic Theorem Proving and Its Applications1995
- The Temporal Logic of Reactive and Concurrent Systems1992
- Automata on Infinite Objects1990
- On the synthesis of a reactive module1989
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985