no code implementations • 1 Sep 2023 • Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar, Paritosh K. Pandya
Moreover, even its 1-variable fragment (1-TPTL$^{0,\infty}$) is strictly more expressive than Metric Interval Temporal Logic (MITL) for which satisfiability checking is EXPSPACE complete.
no code implementations • 28 Jan 2021 • Adwait Godbole, Shankara Narayanan Krishna, Roland Meyer
We show that safety verification is only \pspace-complete for the bounded model checking problem where the distinguished threads are loop-free.
Logic in Computer Science Programming Languages
no code implementations • 18 Jan 2021 • Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
In order to construct an SDRTE associated with an aperiodic deterministic two-way transducer, (i) we concretize Sch\"utzenberger's SD=AP result, by proving that aperiodic languages are captured by SD-regular expressions which are unambiguous and stabilising; (ii) by structural induction on the unambiguous, stabilising SD-regular expressions describing the domain of the transducer, we construct SDRTEs.
Formal Languages and Automata Theory F.4.3
