Sciweavers

ATVA
2010
Springer

LTL Can Be More Succinct

14 years 51 min ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be extended to increase the expressiveness of the logic to all regular languages. Other ways of extending the expressiveness of LTL using modular and group modalities have been explored by Baziramwabo, McKenzie and Th
Kamal Lodaya, A. V. Sreejith
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2010
Where ATVA
Authors Kamal Lodaya, A. V. Sreejith
Comments (0)