Search Results - "Srivathsan, B."

Better abstractions for timed automata by Herbreteau, Frédéric, Srivathsan, B., Walukiewicz, Igor

“…We study the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of…”
Get full text

Simulations for Event-Clock Automata by Akshay, S, Gastin, Paul, Govind, R, Srivathsan, B

“…Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and…”
Get full text

Multiphase simulation of sustainable nanoenhanced ionic liquid coolants for improved thermal performance in Ti–6Al–4V alloy drilling by Srivathsan, B., G, Thaniarasu, Ram, K. Vishnu, R, Harish

“…Extensive research has been conducted by the manufacturing industry to enhance the efficiency of drilling processes by focusing on the utilization of…”
Get full text

An alternate proof of Statmanʼs finite completeness theorem by Srivathsan, B., Walukiewicz, Igor

“…Statmanʼs finite completeness theorem says that for every pair of non-equivalent terms of simply-typed lambda-calculus there is a model that separates them. A…”
Get full text

Coarse abstractions make Zeno behaviours difficult to detect by Herbreteau, Frédéric, Srivathsan, B

“…An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect…”
Get full text

Hand Gesture recognition using Deep Learning by Sangeetha, S., Srivathsan, B, C, Dinesh, Gunaseelan, Rahul, G, Saideepika, K, Srinivasan

“…Sign language is the principal mode of communication for the deaf and dumb community. Conversing with people having such disabilities is a vital challenge…”
Get full text

Deterministic Suffix-reading Automata by Keerthan, R, Srivathsan, B, Venkatesh, R, Verma, Sagar

Get full text

An alternate proof of StatmanE14s finite completeness theorem by Srivathsan, B, Walukiewicz, Igor

“…StatmanE14s finite completeness theorem says that for every pair of non-equivalent terms of simply-typed lambda-calculus there is a model that separates them…”
Get full text

Efficient emptiness check for timed Büchi automata by Herbreteau, Frédéric, Srivathsan, B., Walukiewicz, Igor

“…The Büchi non-emptiness problem for timed automata refers to deciding if a given automaton has an infinite non-Zeno run satisfying the Büchi accepting…”
Get full text

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets by Doveri, Kyveli, Ganty, Pierre, Srivathsan, B

“…The well-known Nerode equivalence for finite words plays a fundamental role in our understanding of the class of regular languages. The equivalence leads to…”
Get full text

A Local-Time Semantics for Negotiations by Mukund, Madhavan, Roy, Adwitee, Srivathsan, B

“…Negotiations, introduced by Esparza et al., are a model for concurrent systems where computations involving a set of agents are described in terms of their…”
Get full text

Deterministic Suffix-reading Automata by Keerthan, R, Srivathsan, B, Venkatesh, R, Verma, Sagar

“…EPTCS 409, 2024, pp. 70-87 We introduce deterministic suffix-reading automata (DSA), a new automaton model over finite words. Transitions in a DSA are labeled…”
Get full text

Better Abstractions for Timed Automata by Herbreteau, F., Srivathsan, B., Walukiewicz, I.

“…We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of…”
Get full text

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm by Akshay, S, Gastin, Paul, Govind, R, Srivathsan, B

“…The translation of Metric Interval Temporal Logic (MITL) to timed automata is a topic that has been extensively studied. A key challenge here is the conversion…”
Get full text

Simulations for Event-Clock Automata by Akshay, S, Gastin, Paul, Govind, R, Srivathsan, B

“…Logical Methods in Computer Science, Volume 20, Issue 3 (July 2, 2024) lmcs:10408 Event-clock automata (ECA) are a well-known semantic subclass of timed…”
Get full text

Efficient Emptiness Check for Timed Büchi Automata by Herbreteau, Frédéric, Srivathsan, B., Walukiewicz, Igor

“…The Büchi non-emptiness problem for timed automata concerns deciding if a given automaton has an infinite non-Zeno run satisfying the Büchi accepting…”
Get full text

Zone-based verification of timed automata: extrapolations, simulations and what next? by Bouyer, Patricia, Gastin, Paul, Herbreteau, Frédéric, Sankur, Ocan, Srivathsan, B

“…Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the last decades, timed automata have become the de facto model for the…”
Get full text

Reachability for Updatable Timed Automata made faster and more effective by Gastin, Paul, Mukherjee, Sayan, Srivathsan, B

“…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…”
Get full text

Pursuance and influence assessment of nanoadditives blended biodiesel fuelled in a di diesel engine by Yoganand, K., Elango, Suriya, Sai Srivathsan, C. B., Hussain, K., Krishna Chaitanya, B.

“…The utilisation of fossil fuels is escalating very rapidly and parallel to that its effects towards the global economy of the country are also increasing which…”
Get full text

A Bridge between Polynomial Optimization and Games with Imperfect Recall by Gimbert, Hugo, Paul, Soumyajit, Srivathsan, B

“…We provide several positive and negative complexity results for solving games with imperfect recall. Using a one-to-one correspondence between these games on…”
Get full text