## Abstract

The computational bottleneck in model-checking applications is the blow-up involved in the translation of systems to their mathematical model. This blow up is especially painful in systems with variables over an infinite domain, and in composite systems described by means of their underlying components. We introduce and study linear temporal logic with arithmetic (LTLA, for short), where formulas include variables that take values in Z, and in which linear arithmetic over these values is supported. We develop an automata-theoretic approach for reasoning about LTLA formulas and use it in order to solve, in PSPACE, the satisfiability problem for the existential fragment of LTLA and the model-checking problem for its universal fragment. We show that these results are tight, as a single universally-quantified variable makes the satisfiability problem for LTLA undecidable. In addition to reasoning about systems with variables over Z, we suggest applications of LTLA in reasoning about hierarchical systems, which consist of subsystems that can call each other in a hierarchical manner. We use the values in Z in order to describe the nesting depth of components in the system. A naive model-checking algorithm for hierarchical systems flattens them, which involves an exponential blow up. We suggest a model-checking algorithm that avoids the flattening and avoids a blow up in the number of components.

Original language | American English |
---|---|

Pages (from-to) | 343-362 |

Number of pages | 20 |

Journal | EPiC Series in Computing |

Volume | 57 |

DOIs | |

State | Published - 2018 |

Event | 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2018 - Awassa, Ethiopia Duration: 17 Nov 2018 → 21 Nov 2018 |

### Bibliographical note

Publisher Copyright:© 2018, EasyChair. All rights reserved.