Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

79

ATVA
2010
Springer

favoriteEmaildiscussreport

217views Hardware» more ATVA 2010»

LTL Can Be More Succinct

14 years 12 months ago

LTL Can Be More Succinct

Download www.imsc.res.in

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

Real-time Traffic

ATVA 2010 | Group Modalities | Hardware | Numeric Constants | Regular Languages |

claim paper

Related Content

» Temporal Logic with Forgettable Past

» Hierarchical and Recursive State Machines with ContextDependent Properties

» Model Checking Succinct and Parametric OneCounter Automata

» Reasoning About Transfinite Sequences

» Extended Temporal Logic Revisited

» On regular temporal logics with past

» Comparing the Succinctness of Monadic Query Languages over Finite Trees

» Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time

» Generating succinct titles for web URLs

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2010
Where	ATVA
Authors	Kamal Lodaya, A. V. Sreejith

Comments (0)