LTL Can Be More Succinct

DOI10.1007/978-3-642-15643-4_19zbMath1305.68120OpenAlexW1599584094MaRDI QIDQ4931296

Kamal Lodaya, A. V. Sreejith

Publication date: 4 October 2010

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15643-4_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

Expressive Completeness for LTL With Modulo Counting and Group Quantifiers ⋮ Making Metric Temporal Logic Rational

This page was built for publication: LTL Can Be More Succinct