### Abstract

We study the “approximability” of unbounded temporal operators
with time-bounded operators, as soon as some time bounds tend
to∞. More specifically, for formulas in the fragments PLTL♦ and
PLTL of the Parametric Linear Temporal Logic of Alur et al.,
we provide algorithms for computing the limit entropy as all parameters
tend to∞. As a consequence, we can decide the problem
whether the limit entropy of a formula in one of the two fragments
coincides with that of its time-unbounded transformation, obtained
by replacing each occurrence of a time-bounded operator into its
time-unbounded version. The algorithms proceed by translation of
the two fragments of PLTL into two classes of discrete-time timed
automata and analysis of their strongly-connected components.

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

Title of host publication | Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |

Publisher | ACM |

ISBN (Electronic) | 978-1-4503-2886-9 |

DOIs | |

Publication status | Published - 2014 |

Event | Joint meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - Vienna, Austria Duration: 14 Jul 2014 → 18 Jul 2014 |

### Conference

Conference | Joint meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
---|---|

Country | Austria |

City | Vienna |

Period | 14/07/14 → 18/07/14 |

## Fingerprint Dive into the research topics of 'Asymptotic behaviour in temporal logic'. Together they form a unique fingerprint.

## Profiles

## Chunyan Mu

- Centre for Digital Innovation
- Department of Computing & Games - Senior Lecturer in Computer Science

Person: Academic

## Cite this

Asarin, E., Bockelet, M., Degorre, A., Dima, C., & Mu, C. (2014). Asymptotic behaviour in temporal logic. In

*Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)*ACM. https://doi.org/10.1145/2603088.2603158