Linear temporal logic (LTL) is a specification language for finite sequences called traces . It is widely used in program verification, motion planning inrobotics, process mining, and many other areas . Existing solutions suffer from two limitations: they do notscale beyond small formulas, and they may exhaust computational resources . We introduce a new algorithm addressing both issues: our algorithm is able to construct formulas an order of magnitudeselarger than previous methods . Weevaluate the performances of our algorithm using an open source implementation against publicly available benchmarks . We use an open-source implementation against public benchmarks .

Author(s) : Ritam Raha, Rajarshi Roy, Nathanaƫl Fijalkow, Daniel Neider

Links : PDF - Abstract

Code :
Coursera

Keywords : formulas - algorithm - temporal - logic - linear -

Leave a Reply

Your email address will not be published. Required fields are marked *