Abstract

We develop a composition technique for linear time logic (LTL) over ordered disjoint sums of words. This technique allows to reduce the validity of an LTL formula in the sum to LTL formulas over the components. It is known that for first order logic (FO) and even its three variable fragment FO3 the number of formulas generated for the components is at least non-elementary in the size of the input formula. We show that for LTL --- expressively equivalent to FO logic --- over an ordered disjoint sum of words the number of formulas for the components can be kept at an at most exponential growth in the size of the input formula.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.