S Akshay
S Akshay
IIT Bombay
Verified email at cse.iitb.ac.in
Title
Cited by
Cited by
Year
Distributed timed automata with independently evolving clocks
S Akshay, B Bollig, P Gastin, M Mukund, KN Kumar
Fundamenta Informaticae 130 (4), 377-407, 2014
44*2014
Reachability problems for Markov chains
S Akshay, T Antonopoulos, J Ouaknine, J Worrell
Information Processing Letters 115 (2), 155-158, 2015
402015
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
372015
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
212015
Automata and logics for timed message sequence charts
S Akshay, B Bollig, P Gastin
International Conference on Foundations of Software Technology and …, 2007
212007
Analyzing timed systems using tree automata
S Akshay, P Gastin, SN Krishna
arXiv preprint arXiv:1604.08443, 2016
182016
Towards parallel Boolean functional synthesis
S Akshay, S Chakraborty, AK John, S Shah
International Conference on Tools and Algorithms for the Construction and …, 2017
172017
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
Checking coverage for infinite collections of timed scenarios
S Akshay, M Mukund, KN Kumar
International Conference on Concurrency Theory, 181-196, 2007
162007
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
152012
Robustness of time Petri nets under guard enlargement
S Akshay, L Hélouët, C Jard, PA Reynier
International Workshop on Reachability Problems, 92-106, 2012
142012
Decidable classes of unbounded Petri nets with time and urgency
S Akshay, B Genest, L Hélouët
International Conference on Applications and Theory of Petri Nets and …, 2016
132016
On regularity of unary probabilistic automata
S Akshay, B Genest, B Karelovic, N Vyas
STACS 2016, 8: 1-8: 14, 2016
92016
What’s hard about Boolean functional synthesis?
S Akshay, S Chakraborty, S Goel, S Kulal, S Shah
International Conference on Computer Aided Verification, 251-269, 2018
82018
Implementing realistic asynchronous automata
S Akshay, I Dinca, B Genest, A Stefanescu
IARCS Annual Conference on Foundations of Software Technology and …, 2013
82013
Regular set of representatives for time-constrained MSC graphs
S Akshay, B Genest, L Hélouët, S Yang
Information Processing Letters 112 (14-15), 592-598, 2012
72012
Combining free choice and time in Petri nets
S Akshay, L Hélouët, R Phawade
Journal of Logical and Algebraic Methods in Programming 110, 100426, 2020
62020
Complexity of Restricted Variants of Skolem and Related Problems
S Akshay, N Balaji, N Vyas
LIPIcs-Leibniz International Proceedings in Informatics 83, 2017
62017
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
62013
Symbolically bounding the drift in time-constrained MSC graphs
S Akshay, B Genest, L Hélouët, S Yang
International Colloquium on Theoretical Aspects of Computing, 1-15, 2012
52012
The system can't perform the operation now. Try again later.
Articles 1–20