From non-punctuality to non-adjacency: A quest for decidability of timed temporal logics with quantifiers

SN Krishna, K Madnani, M Mazo Jr… - Formal Aspects of …, 2023 - dl.acm.org
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent
real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking …

Metric temporal logic with counting

SN Krishna, K Madnani, PK Pandya - … , FOSSACS 2016, Held as Part of the …, 2016 - Springer
Metric Temporal Logic with Counting | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book …

Making metric temporal logic rational

SN Krishna, K Madnani, PK Pandya - arXiv preprint arXiv:1705.01501, 2017 - arxiv.org
We study an extension of $\mtl $ in pointwise time with rational expression guarded modality
$\reg_I (\re) $ where $\re $ is a rational expression over subformulae. We study the …

Logics meet 1-clock alternating timed automata

SN Krishna, K Madnani… - … on Concurrency Theory …, 2018 - drops.dagstuhl.de
This paper investigates a decidable and highly expressive real time logic QkMSO which is
obtained by extending MSO [<] with guarded quantification using block of less than k metric …

Generalizing non-punctuality for timed temporal logic with freeze quantifiers

SN Krishna, K Madnani, M Mazo… - Formal Methods: 24th …, 2021 - Springer
Abstract Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are
prominent real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability …

Openness And Partial Adjacency In One Variable TPTL

SN Krishna, K Madnani, A Nag, P Pandya - arXiv preprint arXiv …, 2024 - arxiv.org
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) extend Linear
Temporal Logic (LTL) for real-time constraints, with MTL using time-bounded modalities and …

Metric temporal logic with counting

K Madnani, SN Krishna, P Pandya - arXiv preprint arXiv:1512.09032, 2015 - arxiv.org
Ability to count number of occurrences of events within a specified time interval is very useful
in specification of resource bounded real time computation. In this paper, we study an …

B\" uchi-Kamp Theorems for 1-clock ATA

SN Krishna, K Madnani, P Pandya - arXiv preprint arXiv:1802.02514, 2018 - arxiv.org
This paper investigates Kamp-like and B\" uchi-like theorems for 1-clock Alternating Timed
Automata (1-ATA) and its natural subclasses. A notion of 1-ATA with loop-free-resets is …