On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions

In this paper, we investigate the model checking (MC) problem for Halpern and Shoham's interval temporal logic HS. In the last years, interval temporal logic MC has received an increasing attention as a viable alternative to the traditional (point-based) temporal logic MC, which can be recover...

Full description

Bibliographic Details
Main Authors: Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
Format: Article
Language:English
Published: Open Publishing Association 2017-09-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1709.02094v1

Internet

http://arxiv.org/pdf/1709.02094v1

Similar Items