B. Srivathsan - RankMe

62 papers A* 6A 2B 10Journal 31Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata. TACAS (1) Kyveli Doveri, Pierre Ganty, B. Srivathsan
2026	J	`jnl`	A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata. CoRR Kyveli Doveri, Pierre Ganty, B. Srivathsan
2026	B	`ed.`	Automated Technology for Verification and Analysis - 23rd International Symposium, ATVA 2025, Bengaluru, India, October 27-31, 2025, Proceedings ATVA Meenakshi D'Souza, Raghavan Komondoor, B. Srivathsan
2026	B	`conf`	Synthesising Asynchronous Automata from Fair Specifications. FoSSaCS Béatrice Bérard, Benjamin Monmege, B. Srivathsan, Arnab Sur
2026	—	`conf`	TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics. TACAS (1) S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan
2025	—	`conf`	An Automaton Model to Succinctly Represent Suffix-Based Specifications of a Concurrent System. NETYS R. Keerthan, B. Srivathsan, R. Venkatesh
2025	J	`jnl`	Deterministic Suffix-reading Automata. CoRR R. Keerthan, B. Srivathsan, R. Venkatesh, Sagar Verma
2025	J	`jnl`	Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics. CoRR S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan
2025	B	`conf`	Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route. FoSSaCS Patricia Bouyer, B. Srivathsan, Vaishnavi Vishwanath
2025	J	`jnl`	Model-checking real-time systems: revisiting the alternating automaton route. CoRR Patricia Bouyer, B. Srivathsan, Vaishnavi Vishwanath
2025	A	`conf`	Simplifying Imperfect Recall Games. AAMAS Hugo Gimbert, Soumyajit Paul, B. Srivathsan
2025	J	`jnl`	Simplifying imperfect recall games. CoRR Hugo Gimbert, Soumyajit Paul, B. Srivathsan
2025	J	`jnl`	Synthesising Asynchronous Automata from Fair Specifications. CoRR Béatrice Bérard, Benjamin Monmege, B. Srivathsan, Arnab Sur
2025	—	`conf`	Using Communication to Bound Clock Drift in Local-Timed Negotiations. QEST+FORMATS Abhinav Garg, Madhavan Mukund, Adwitee Roy, B. Srivathsan, Gautham Viswanathan
2024	—	`conf`	A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets. FSTTCS Kyveli Doveri, Pierre Ganty, B. Srivathsan
2024	J	`jnl`	A Myhill-Nerode style Characterization for Timed Automata With Integer Resets. CoRR Kyveli Doveri, Pierre Ganty, B. Srivathsan
2024	—	`conf`	Deterministic Suffix-reading Automata. GandALF R. Keerthan, B. Srivathsan, R. Venkatesh, Sagar Verma
2024	B	`conf`	MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CONCUR S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2024	J	`jnl`	MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CoRR S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2024	J	`jnl`	Simulations for Event-Clock Automata. Log. Methods Comput. Sci. S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2023	—	`conf`	A Local-Time Semantics for Negotiations. FORMATS Madhavan Mukund, Adwitee Roy, B. Srivathsan
2023	J	`jnl`	A Local-Time Semantics for Negotiations. CoRR Madhavan Mukund, Adwitee Roy, B. Srivathsan
2023	—	`conf`	A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CAV (1) S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
2023	J	`jnl`	A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CoRR S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
2022	A*	`conf`	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. LICS R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2022	B	`conf`	Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. CONCUR Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2022	J	`jnl`	Reachability in timed automata. ACM SIGLOG News B. Srivathsan
2022	B	`conf`	Simulations for Event-Clock Automata. CONCUR S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2022	J	`jnl`	Simulations for Event-Clock Automata. CoRR S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2022	—	`conf`	Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
2022	J	`jnl`	Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
2020	A	`conf`	A Bridge between Polynomial Optimization and Games with Imperfect Recall. AAMAS Hugo Gimbert, Soumyajit Paul, B. Srivathsan
2020	J	`jnl`	A Bridge between Polynomial Optimization and Games with Imperfect Recall. CoRR Hugo Gimbert, Soumyajit Paul, B. Srivathsan
2020	—	`conf`	Reachability for Updatable Timed Automata Made Faster and More Effective. FSTTCS Paul Gastin, Sayan Mukherjee, B. Srivathsan
2020	J	`jnl`	Reachability for Updatable Timed Automata made faster and more effective. CoRR Paul Gastin, Sayan Mukherjee, B. Srivathsan
2020	J	`jnl`	Why Liveness for Timed Automata Is Hard, and What We Can Do About It. ACM Trans. Comput. Log. Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
2019	—	`conf`	Fast Algorithms for Handling Diagonal Constraints in Timed Automata. CAV (1) Paul Gastin, Sayan Mukherjee, B. Srivathsan
2019	J	`jnl`	Fast algorithms for handling diagonal constraints in timed automata. CoRR Paul Gastin, Sayan Mukherjee, B. Srivathsan
2019	B	`conf`	Revisiting Local Time Semantics for Networks of Timed Automata. CONCUR R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2019	J	`jnl`	Revisiting local time semantics for networks of timed automata. CoRR R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2018	B	`conf`	Reachability in Timed Automata with Diagonal Constraints. CONCUR Paul Gastin, Sayan Mukherjee, B. Srivathsan
2018	J	`jnl`	Reachability in timed automata with diagonal constraints. CoRR Paul Gastin, Sayan Mukherjee, B. Srivathsan
2016	J	`jnl`	Better abstractions for timed automata. Inf. Comput. Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2016	J	`jnl`	Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity. CoRR M. Praveen, B. Srivathsan
2016	A*	`conf`	Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. ICALP M. Praveen, B. Srivathsan
2016	—	`conf`	Why Liveness for Timed Automata Is Hard, and What We Can Do About It. FSTTCS Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
2015	A*	`conf`	Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? PODS M. Praveen, B. Srivathsan
2014	J	`jnl`	Defining relations on graphs: how hard is it in the presence of node partitions? CoRR M. Praveen, B. Srivathsan
2014	J	`jnl`	Fast detection of cycles in timed automata. CoRR Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
2013	A*	`conf`	Lazy Abstractions for Timed Automata. CAV Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2013	J	`jnl`	Lazy abstractions for timed automata CoRR Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2012	J	`jnl`	An alternate proof of Statman's finite completeness theorem. Inf. Process. Lett. B. Srivathsan, Igor Walukiewicz
2012	A*	`conf`	Better Abstractions for Timed Automata. LICS Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2012	J	`jnl`	Efficient emptiness check for timed Büchi automata. Formal Methods Syst. Des. Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2011	J	`jnl`	Better abstractions for timed automata CoRR Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2011	B	`conf`	Coarse Abstractions Make Zeno Behaviours Difficult to Detect. CONCUR Frédéric Herbreteau, B. Srivathsan
2011	J	`jnl`	Coarse abstractions make Zeno behaviours difficult to detect Log. Methods Comput. Sci. Frédéric Herbreteau, B. Srivathsan
2011	J	`jnl`	Efficient Emptiness Check for Timed Büchi Automata (Extended version) CoRR Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2011	J	`jnl`	Using non-convex approximations for efficient analysis of timed automata CoRR Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
2011	—	`conf`	Using non-convex approximations for efficient analysis of timed automata. FSTTCS Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
2010	A*	`conf`	Efficient Emptiness Check for Timed Büchi Automata. CAV Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2010	B	`conf`	Efficient On-the-Fly Emptiness Check for Timed Büchi Automata. ATVA Frédéric Herbreteau, B. Srivathsan