default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDB. Srivathsan
Person information
- affiliation: Chennai Mathematical Institute, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. Log. Methods Comput. Sci. 20(3) (2024)- [c21]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CONCUR 2024: 5:1-5:19 - [i17]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CoRR abs/2407.08452 (2024) - 2023
- [c20]S. Akshay
, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan:
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CAV (1) 2023: 266-288 - [c19]Madhavan Mukund, Adwitee Roy, B. Srivathsan:
A Local-Time Semantics for Negotiations. FORMATS 2023: 105-121 - [i16]S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan:
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CoRR abs/2305.17824 (2023) - [i15]Madhavan Mukund, Adwitee Roy, B. Srivathsan:
A Local-Time Semantics for Negotiations. CoRR abs/2307.06691 (2023) - 2022
- [j6]B. Srivathsan:
Reachability in timed automata. ACM SIGLOG News 9(3): 6-28 (2022) - [c18]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. CONCUR 2022: 12:1-12:24 - [c17]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. CONCUR 2022: 13:1-13:18 - [c16]Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan:
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS 2022: 16-42 - [c15]R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. LICS 2022: 24:1-24:14 - [i14]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. CoRR abs/2207.02633 (2022) - [i13]Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan:
Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR abs/2207.07479 (2022) - 2020
- [j5]Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz:
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. ACM Trans. Comput. Log. 21(3): 17:1-17:28 (2020) - [c14]Hugo Gimbert, Soumyajit Paul, B. Srivathsan:
A Bridge between Polynomial Optimization and Games with Imperfect Recall. AAMAS 2020: 456-464 - [c13]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability for Updatable Timed Automata Made Faster and More Effective. FSTTCS 2020: 47:1-47:17 - [i12]Hugo Gimbert, Soumyajit Paul, B. Srivathsan:
A Bridge between Polynomial Optimization and Games with Imperfect Recall. CoRR abs/2002.09941 (2020) - [i11]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability for Updatable Timed Automata made faster and more effective. CoRR abs/2009.13260 (2020)
2010 – 2019
- 2019
- [c12]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Fast Algorithms for Handling Diagonal Constraints in Timed Automata. CAV (1) 2019: 41-59 - [c11]R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Revisiting Local Time Semantics for Networks of Timed Automata. CONCUR 2019: 16:1-16:15 - [i10]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Fast algorithms for handling diagonal constraints in timed automata. CoRR abs/1904.08590 (2019) - [i9]R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Revisiting local time semantics for networks of timed automata. CoRR abs/1907.02296 (2019) - 2018
- [c10]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability in Timed Automata with Diagonal Constraints. CONCUR 2018: 28:1-28:17 - [i8]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability in timed automata with diagonal constraints. CoRR abs/1806.11007 (2018) - 2016
- [j4]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. Inf. Comput. 251: 67-90 (2016) - [c9]Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz:
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. FSTTCS 2016: 48:1-48:14 - [c8]M. Praveen, B. Srivathsan:
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. ICALP 2016: 117:1-117:14 - [i7]M. Praveen, B. Srivathsan:
Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity. CoRR abs/1603.00658 (2016) - 2015
- [c7]M. Praveen, B. Srivathsan:
Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? PODS 2015: 159-172 - 2014
- [i6]Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz:
Fast detection of cycles in timed automata. CoRR abs/1410.4509 (2014) - [i5]M. Praveen, B. Srivathsan:
Defining relations on graphs: how hard is it in the presence of node partitions? CoRR abs/1412.4463 (2014) - 2013
- [c6]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Lazy Abstractions for Timed Automata. CAV 2013: 990-1005 - [i4]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Lazy abstractions for timed automata. CoRR abs/1301.3127 (2013) - 2012
- [j3]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient emptiness check for timed Büchi automata. Formal Methods Syst. Des. 40(2): 122-146 (2012) - [j2]B. Srivathsan, Igor Walukiewicz:
An alternate proof of Statman's finite completeness theorem. Inf. Process. Lett. 112(14-15): 612-616 (2012) - [c5]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better Abstractions for Timed Automata. LICS 2012: 375-384 - 2011
- [j1]Frédéric Herbreteau, B. Srivathsan:
Coarse abstractions make Zeno behaviours difficult to detect. Log. Methods Comput. Sci. 9(1) (2011) - [c4]Frédéric Herbreteau, B. Srivathsan:
Coarse Abstractions Make Zeno Behaviours Difficult to Detect. CONCUR 2011: 92-107 - [c3]Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz:
Using non-convex approximations for efficient analysis of timed automata. FSTTCS 2011: 78-89 - [i3]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient Emptiness Check for Timed Büchi Automata (Extended version). CoRR abs/1104.1540 (2011) - [i2]Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz:
Using non-convex approximations for efficient analysis of timed automata. CoRR abs/1110.3704 (2011) - [i1]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. CoRR abs/1110.3705 (2011) - 2010
- [c2]Frédéric Herbreteau, B. Srivathsan:
Efficient On-the-Fly Emptiness Check for Timed Büchi Automata. ATVA 2010: 218-232 - [c1]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient Emptiness Check for Timed Büchi Automata. CAV 2010: 148-161
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
