3 citations · 5 across the 6 of their papers we have counts for
7 papers · 1 filter
A Simple Obligation to Metric Interval Temporal Logic
Patricia Bouyer, B Srivathsan, Vaishnavi Vishwanath
Satisfiability of Metric Interval Temporal Logic (MITL) is a widely investigated subject. In this work, we present a new, and arguably simpler, approach for MITL satisfiability, ba…
Model-checking real-time systems: revisiting the alternating automaton route
Patricia Bouyer, B Srivathsan, Vaishnavi Vishwanath
Alternating timed automata (ATA) are an extension of timed automata, that are closed under complementation and hence amenable to logic-to-automata translations. Several timed logic…
Reachability for Updatable Timed Automata made faster and more effective
Paul Gastin, Sayan Mukherjee, B Srivathsan
Updatable timed automata (UTA) are extensions of classic timed automata that allow special updates to clock variables, like x:= x - 1, x := y + 2, etc., on transitions. Reachabilit…
Revisiting local time semantics for networks of timed automata
R. Govind, Frédéric Herbreteau, B. Srivathsan +1
We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks…
Reachability in timed automata with diagonal constraints
Paul Gastin, Sayan Mukherjee, B Srivathsan
We consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enu…
Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
M. Praveen, B. Srivathsan
Designing query languages for graph structured data is an active field of research, where expressiveness and efficient algorithms for query evaluation are conflicting goals. To bet…