S. Akshay

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 68

Top Topics

Markov Decision Process

First Order Logic

Top Venues

Publications

S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CoRR (2024)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. Log. Methods Comput. Sci. 20 (3) (2024)
S. Akshay, Tobias Meggendorfer, P. S. Thiagarajan
Causally Deterministic Markov Decision Processes. CONCUR (2024)
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
Auditable Algorithms for Approximate Model Counting. AAAI (2024)
S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-avoidance Properties. CoRR (2024)
S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. Log. Methods Comput. Sci. 20 (2) (2024)
S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried
On Dependent Variables in Reactive Synthesis. TACAS (1) (2024)
S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. LPAR (2024)
S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried
On Dependent Variables in Reactive Synthesis. CoRR (2024)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CONCUR (2024)
S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. CAV (3) (2023)
S. Akshay, Supratik Chakraborty, Sahil Jain
Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis. CAV (1) (2023)
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)
Mohammad Afzal, Ashutosh Gupta, S. Akshay
Using Counterexamples to Improve Robustness Verification in Neural Networks. ATVA (1) (2023)
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
Auditable Algorithms for Approximate Model Counting. CoRR (2023)
S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CoRR (2023)
Hazem Torfah, Aniruddha R. Joshi, Shetal Shah, S. Akshay, Supratik Chakraborty, Sanjit A. Seshia
Learning Monitor Ensembles for Operational Design Domains. RV (2023)
S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala
On Robustness for the Skolem and Positivity Problems. STACS (2022)
S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. CoRR (2022)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. CoRR (2022)
S. Akshay, Supratik Chakraborty, Debtanu Pal
On eventual non-negativity and positivity for the weighted sum of powers of matrices. CoRR (2022)
S. Akshay, Supratik Chakraborty, Debtanu Pal
On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices. IJCAR (2022)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. CONCUR (2022)
Supratik Chakraborty, S. Akshay
On Synthesizing Computable Skolem Functions for First Order Logic. MFCS (2022)
Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. FMCAD (2021)
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah
Boolean functional synthesis: hardness and practical algorithms. Formal Methods Syst. Des. 57 (1) (2021)
Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. LICS (2021)
S. Akshay, Paul Gastin, Karthik R. Prakash
Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata. CAV (1) (2021)
Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. CoRR (2021)
S. Akshay, Paul Gastin, Karthik R. Prakash
Fast zone-based algorithms for reachability in pushdown timed automata. CoRR (2021)
S. Akshay, Blaise Genest, Loïc Hélouët, Shankara Narayanan Krishna, Sparsa Roychowdhury
Resilience of Timed Systems. FSTTCS (2021)
Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. CoRR (2021)
S. Akshay, Supratik Chakraborty
On synthesizing Skolem functions for first order logic formulae. CoRR (2021)
Kuldeep S. Meel, S. Akshay
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. LICS (2020)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Sparsa Roychowdhury
Revisiting Underapproximate Reachability for Multipushdown Systems. TACAS (1) (2020)
S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. STACS (2020)
S. Akshay, Loïc Hélouët, Ramchandra Phawade
Combining free choice and time in Petri nets. J. Log. Algebraic Methods Program. 110 (2020)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Sparsa Roychowdhury
Revisiting Underapproximate Reachability for Multipushdown Systems. CoRR (2020)
S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital
Timed Negotiations. FoSSaCS (2020)
Kuldeep S. Meel, S. Akshay
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. CoRR (2020)
S. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan, Prasanna Venkatraman
Functional Significance Checking in Noisy Gene Regulatory Networks. CP (2019)
Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
Continuous Reachability for Unordered Data Petri nets is in PTime. CoRR (2019)
S. Akshay, Hugo Bazille, Eric Fabre, Blaise Genest
Classification Among Hidden Markov Models. FSTTCS (2019)
S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna
Timed Systems through the Lens of Logic. CoRR (2019)
S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah
Knowledge Compilation for Boolean Functional Synthesis. FMCAD (2019)
Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
Continuous Reachability for Unordered Data Petri Nets is in PTime. FoSSaCS (2019)
S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah
Knowledge Compilation for Boolean Functional Synthesis. CoRR (2019)
S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna
Timed Systems through the Lens of Logic. LICS (2019)
S. Akshay, Blaise Genest, Nikhil Vyas
Distribution-based objectives for Markov Decision Processes. CoRR (2018)
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah
What's Hard About Boolean Functional Synthesis? CAV (1) (2018)
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah
What's hard about Boolean Functional Synthesis. CoRR (2018)
S. Akshay, Blaise Genest, Nikhil Vyas
Distribution-based objectives for Markov Decision Processes. LICS (2018)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
Analyzing Timed Systems Using Tree Automata. Log. Methods Comput. Sci. 14 (2) (2018)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar
Towards an Efficient Tree Automata based technique for Timed Systems. CoRR (2017)
S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah
Towards Parallel Boolean Functional Synthesis. TACAS (1) (2017)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar
Towards an Efficient Tree Automata Based Technique for Timed Systems. CONCUR (2017)
S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep
On Petri Nets with Hierarchical Special Arcs. CoRR (2017)
S. Akshay, Nikhil Balaji, Nikhil Vyas
Complexity of Restricted Variants of Skolem and Related Problems. MFCS (2017)
S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah
Towards Parallel Boolean Functional Synthesis. CoRR (2017)
S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep
On Petri Nets with Hierarchical Special Arcs. CONCUR (2017)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
Analyzing Timed Systems Using Tree Automata. CONCUR (2016)
S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi
Stochastic Timed Games Revisited. CoRR (2016)
S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier
Robustness of Time Petri Nets under Guard Enlargement. Fundam. Informaticae 143 (3-4) (2016)
S. Akshay, Loïc Hélouët, Ramchandra Phawade
Combining Free Choice and Time in Petri Nets. TIME (2016)
S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas
On Regularity of Unary Probabilistic Automata. STACS (2016)
S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi
Stochastic Timed Games Revisited. MFCS (2016)
S. Akshay, Blaise Genest, Loïc Hélouët
Decidable Classes of Unbounded Petri Nets with Time and Urgency. Petri Nets (2016)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
Analyzing Timed Systems Using Tree Automata. CoRR (2016)
Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay
Skolem Functions for Factored Formulas. FMCAD (2015)
S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Checking conformance for time-constrained scenario-based specifications. Theor. Comput. Sci. 594 (2015)
Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay
Skolem Functions for Factored Formulas. CoRR (2015)
S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell
Reachability problems for Markov chains. Inf. Process. Lett. 115 (2) (2015)
Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan
Approximate Verification of the Symbolic Dynamics of Markov Chains. J. ACM 62 (1) (2015)
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130 (4) (2014)
S. Akshay, Loïc Hélouët, Madhavan Mukund
Sessions with an Unbounded Number of Agents. ACSD (2014)
S. Akshay, Benedikt Bollig, Paul Gastin
Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Formal Methods Syst. Des. 42 (3) (2013)
S. Akshay, Nathalie Bertrand, Serge Haddad, Loïc Hélouët
The Steady-State Control Problem for Markov Decision Processes. QEST (2013)
S. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu
Implementing Realistic Asynchronous Automata. FSTTCS (2013)
S. Akshay, Loïc Hélouët, Claude Jard, Didier Lime, Olivier H. Roux
Robustness of Time Petri Nets under Architectural Constraints. FORMATS (2012)
Sucheendra K. Palaniappan, S. Akshay, Bing Liu, Blaise Genest, P. S. Thiagarajan
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (5) (2012)
Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan
Approximate Verification of the Symbolic Dynamics of Markov Chains. LICS (2012)
S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier
Robustness of Time Petri Nets under Guard Enlargement. RP (2012)
S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang
Regular set of representatives for time-constrained MSC graphs. Inf. Process. Lett. 112 (14-15) (2012)
S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang
Symbolically Bounding the Drift in Time-Constrained MSC Graphs. ICTAC (2012)
Sucheendra K. Palaniappan, S. Akshay, Blaise Genest, P. S. Thiagarajan
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways. CMSB (2011)
S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Model checking time-constrained scenario-based specifications. FSTTCS (2010)
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Distributed Timed Automata with Independently Evolving Clocks. CONCUR (2008)
S. Akshay, Benedikt Bollig, Paul Gastin
Automata and Logics for Timed Message Sequence Charts. FSTTCS (2007)
S. Akshay, Madhavan Mukund, K. Narayan Kumar
Checking Coverage for Infinite Collections of Timed Scenarios. CONCUR (2007)