Sledovat
S Akshay
S Akshay
IIT Bombay
E-mailová adresa ověřena na: cse.iitb.ac.in
Název
Citace
Citace
Rok
Approximate verification of the symbolic dynamics of Markov chains
M Agrawal, S Akshay, B Genest, PS Thiagarajan
Journal of the ACM (JACM) 62 (1), 1-34, 2015
692015
Reachability problems for Markov chains
S Akshay, T Antonopoulos, J Ouaknine, J Worrell
Information Processing Letters 115 (2), 155-158, 2015
692015
Distributed timed automata with independently evolving clocks
S Akshay, B Bollig, P Gastin, M Mukund, KN Kumar
Fundamenta Informaticae 130 (4), 377-407, 2014
51*2014
Skolem functions for factored formulas
AK John, S Shah, S Chakraborty, A Trivedi, S Akshay
2015 Formal Methods in Computer-Aided Design (FMCAD), 73-80, 2015
372015
Sparse hashing for scalable approximate model counting: theory and practice
KS Meel, S Akshay
Proceedings of the 35th annual ACM/IEEE symposium on logic in computer …, 2020
362020
What’s hard about Boolean functional synthesis?
S Akshay, S Chakraborty, S Goel, S Kulal, S Shah
Computer Aided Verification: 30th International Conference, CAV 2018, Held …, 2018
312018
Towards parallel Boolean functional synthesis
S Akshay, S Chakraborty, AK John, S Shah
International Conference on Tools and Algorithms for the Construction and …, 2017
282017
Knowledge compilation for Boolean functional synthesis
S Akshay, J Arora, S Chakraborty, S Krishna, D Raghunathan, S Shah
2019 Formal Methods in Computer Aided Design (FMCAD), 161-169, 2019
272019
Analyzing timed systems using tree automata
S Akshay, P Gastin, SN Krishna
Logical Methods in Computer Science 14, 2018
212018
Decidable classes of unbounded Petri nets with time and urgency
S Akshay, B Genest, L Hélouët
Application and Theory of Petri Nets and Concurrency: 37th International …, 2016
212016
The steady-state control problem for Markov decision processes
S Akshay, N Bertrand, S Haddad, L Helouet
International conference on quantitative evaluation of systems, 290-304, 2013
212013
Automata and logics for timed message sequence charts
S Akshay, B Bollig, P Gastin
International Conference on Foundations of Software Technology and …, 2007
212007
Checking coverage for infinite collections of timed scenarios
S Akshay, M Mukund, KN Kumar
International Conference on Concurrency Theory, 181-196, 2007
212007
A hybrid factored frontier algorithm for dynamic Bayesian networks with a biopathways application
SK Palaniappan, S Akshay, B Liu, B Genest, PS Thiagarajan
IEEE/ACM Transactions on Computational biology and bioinformatics 9 (5 …, 2012
202012
Distribution-based objectives for Markov decision processes
S Akshay, B Genest, N Vyas
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
162018
Model checking time-constrained scenario-based specifications
S Akshay, P Gastin, M Mukund, K Narayan Kumar
IARCS Annual Conference on Foundations of Software Technology and …, 2010
162010
Complexity of Restricted Variants of Skolem and Related Problems
S Akshay, N Balaji, N Vyas
LIPIcs-Leibniz International Proceedings in Informatics 83, 2017
142017
Robustness of time Petri nets under guard enlargement
S Akshay, L Hélouët, C Jard, PA Reynier
Reachability Problems: 6th International Workshop, RP 2012, Bordeaux, France …, 2012
132012
Boolean functional synthesis: hardness and practical algorithms
S Akshay, S Chakraborty, S Goel, S Kulal, S Shah
Formal Methods in System Design 57, 53-86, 2021
122021
On robustness for the skolem and positivity problems
S Akshay, H Bazille, B Genest, M Vahanwala
STACS 2022-39th International Symposium on Theoretical Aspects of Computer …, 2022
112022
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20