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 FO 3 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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Felscher, I. (2012). LTL-model-checking via model composition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7550 LNCS, pp. 42–53). https://doi.org/10.1007/978-3-642-33512-9_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
