LTL Can Be More Succinct

DOI10.1007/978-3-642-15643-4_19MaRDI QIDQ4931296zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Improving LTL truck load utilization on line
• Discounting in LTL
• Taming past LTL and flat counter systems
• Taming past LTL and flat counter systems
• LTL logistics networks with differentiated services
• Averaging in LTL
• An Algorithmic Framework for Routeing LTL Shipments
• Near real-time loadplan adjustments for less-than-truckload carriers
• Weighted LTL with discounting

Cited in

(5)

• Expressive completeness for LTL with modulo counting and group quantifiers
• The complexity of counting models of linear-time temporal logic
• Making Metric Temporal Logic Rational
• Safely Freezing LTL
• When do you start counting? Revisiting counting and Pnueli modalities in timed logics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931296)