On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics

Holla, R and Deka, N and DSouza, D (2021) On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics. In: Leibniz International Proceedings in Informatics, LIPIcs, 213 .

PDF LIPI_FSTTCS_2021.pdf - Published Version Restricted to Registered users only Download (740kB) | Request a copy

Abstract

We consider a first-order logic with linear constraints interpreted in a pointwise and continuous manner over timed words. We show that the two interpretations of this logic coincide in terms of expressiveness, via an effective transformation of sentences from one logic to the other. As a consequence it follows that the pointwise and continuous semantics of the logic TPTL with the since operator also coincide. Along the way we exhibit a useful normal form for sentences in these logics. © Raveendra Holla, Nabarun Deka, and Deepak D�Souza.

Item Type:	Journal Article
Publication:	Leibniz International Proceedings in Informatics, LIPIcs
Publisher:	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Additional Information:	The copyright for this article belongs to Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Keywords:	Computer circuits; Semantics, Continuous semantics; First order logic; Linear constraints; Normal form; Point wise; Real-time logic, Formal logic
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	27 Jan 2022 11:47
Last Modified:	27 Jan 2022 11:47
URI:	http://eprints.iisc.ac.in/id/eprint/71041

Actions (login required)

View Item