Title of article
The Complexity of Propositional Linear Temporal Logics in Simple Cases
Author/Authors
Stéphane Demri، نويسنده , , Philippe Schnoebelen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
20
From page
84
To page
103
Keywords
Verification , logic in computer science , computational complexity , modelchecking. , Temporal Logic
Journal title
Information and Computation
Serial Year
2002
Journal title
Information and Computation
Record number
262044
Link To Document