B. Srivathsan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2023

A Unified Model for Real-Time Systems: Symbolic Techniques and ImplementationS. Akshay 0001, Paul Gastin, R. Govind 0001, Aniruddha R. Joshi, B. Srivathsan. cav 2023: 266-288 [doi]

A Local-Time Semantics for NegotiationsMadhavan Mukund, Adwitee Roy, B. Srivathsan. formats 2023: 105-121 [doi]

2022

2020

Reachability for Updatable Timed Automata Made Faster and More EffectivePaul Gastin, Sayan Mukherjee 0002, B. Srivathsan. fsttcs 2020: [doi]

A Bridge between Polynomial Optimization and Games with Imperfect RecallHugo Gimbert, Soumyajit Paul, B. Srivathsan. atal 2020: 456-464 [doi]

Why Liveness for Timed Automata Is Hard, and What We Can Do About ItFrédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz. tocl, 21(3), 2020. [doi]

2019

Fast Algorithms for Handling Diagonal Constraints in Timed AutomataPaul Gastin, Sayan Mukherjee 0002, B. Srivathsan. cav 2019: 41-59 [doi]

Revisiting Local Time Semantics for Networks of Timed AutomataR. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. concur 2019: [doi]

2018

Reachability in Timed Automata with Diagonal ConstraintsPaul Gastin, Sayan Mukherjee, B. Srivathsan. concur 2018: [doi]

2016

Better abstractions for timed automataFrédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. iandc, 251:67-90, 2016. [doi]

Why Liveness for Timed Automata Is Hard, and What We Can Do About ItFrédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz. fsttcs 2016: [doi]

Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation ComplexityM. Praveen, B. Srivathsan. icalp 2016: [doi]

2015

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?M. Praveen, B. Srivathsan. PODS 2015: 159-172 [doi]

2013

Lazy Abstractions for Timed AutomataFrédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. cav 2013: 990-1005 [doi]

2012

Efficient emptiness check for timed Büchi automataFrédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. fmsd, 40(2):122-146, 2012. [doi]

Better Abstractions for Timed AutomataFrédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. lics 2012: 375-384 [doi]

An alternate proof of Statman's finite completeness theoremB. Srivathsan, Igor Walukiewicz. ipl, 112(14-15):612-616, 2012. [doi]

2011

Coarse Abstractions Make Zeno Behaviours Difficult to DetectFrédéric Herbreteau, B. Srivathsan. concur 2011: 92-107 [doi]

Using non-convex approximations for efficient analysis of timed automataFrédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz. fsttcs 2011: 78-89 [doi]

2010

Efficient On-the-Fly Emptiness Check for Timed Büchi AutomataFrédéric Herbreteau, B. Srivathsan. ATVA 2010: 218-232 [doi]

Efficient Emptiness Check for Timed Büchi AutomataFrédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. cav 2010: 148-161 [doi]

Sign in or sign up to see more results.

runs on WebDSL