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

• Type: Conference
• Year: 2010
• Where: ATVA
• Authors: Kamal Lodaya, A. V. Sreejith
• Keywords: ATVA 2010, Group Modalities, Hardware, Numeric Constants, Regular Languages