Publications
Journals

S. Akshay,
P. Gastin,
S. Krishna.
Analyzing Timed Systems Using Tree Automata.
In Logical Methods in Computer Science, Volume 14 (2:8), pages 135, 2018. pdf (A preliminary version appeared at CONCUR'16.)
 S. Akshay,
L. Helouet,
C. Jard,
P.A. Reynier.
Robustness of time Petri nets under guard enlargement.
In Fundamenta Informaticae, volume 143, number 34, pages 207234, 2016. (A preliminary version appeared at RP'12.)

S. Akshay,
T. Antonopoulos,
J. Ouaknine,
J. Worrell.
Reachability problems for Markov chains.
In Information Processing Letters, Elsevier, Volume 115, Number 2, Pages 155158, 2015. pdf

S. Akshay,
P. Gastin,
M. Mukund,
K. Narayan Kumar.
Checking conformance for timeconstrained scenariobased specifications.
In Theoretical Computer Science, Elsevier, 2015. online version (Preliminary versions of some results appeared in CONCUR'07 and FSTTCS'10.)

M. Agrawal,
S. Akshay,
B. Genest,
P. S. Thiagarajan.
Approximate verification of the symbolic dynamics of Markov chains.
In Journal of the ACM, Volume 62, Number 1, Article 2, 2015. pdf
(A preliminary version appeared at LICS'12.)

S. Akshay,
B. Bollig,
P. Gastin,
M. Mukund,
K. Narayan Kumar.
Distributed timed automata with independently evolving clocks.
In Fundamenta Informaticae, IOS Press, Volume 130, Number 4, Pages 377407, 2014. pdf (A preliminary version appeared at CONCUR'08.)

S. Akshay,
B. Bollig,
P. Gastin.
Eventclock Message Passing Automata: A logical characterization and an emptiness checking algorithm.
In Formal Methods in Systems Design, Springer, Volume 42, Number 3, Pages 262300, 2013. (A preliminary version appeared at FSTTCS'07.)

S. K. Palaniappan,
S. Akshay,
B. Liu,
B. Genest,
P. S. Thiagarajan.
A hybrid factored frontier algorithm for dynamic Bayesian networks with a biopathway application.
In IEEE/ACM Transactions on Computational Biology and Bioinformatics, IEEE Computer Society Press, Volume 9, Number 5, Pages 13521365, 2012.
pdf (A preliminary version appeared at CMSB'11.)

S. Akshay,
B. Genest,
L. Helouet.
S. Yang.
Regular sets of representatives for TimeConstrained MSC Graphs.
In Information Processing Letters, Elsevier, Volume 112, Issues 1415, 15 August Pages 592598, 2012. pdf
Conferences

S. Akshay,
B. Genest,
N. Vyas.
Distributionbased objectives for Markov Decision Processes
Accepted at the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018) to be held during 912 July 2018 at Oxford, UK. To appear. pdf (arXiv version)

S. Akshay,
S. Chakraborty,
S. Goel ,
S. Kulal,
S. Shah.
What's hard about boolean functional synthesis
Accepted at the 30th International Conference on Computer Aided Verification (CAV 2018) to be held during 1417 July 2018 at Oxford, UK. To appear.
pdf (arXiv version)

S. Akshay,
N. Balaji,
N. Vyas.
Complexity of restricted variants of Skolem and related problems.
In the proceedings of 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) August 2125, 2017, Aalborg, Denmark.

S. Akshay,
S. Chakraborty,
A. Das,
V. Jagannath,
S. Sandeep.
On Petri Nets with Hierarchical Special Arcs.
In the proceedings of the International Conference on Concurrency Theory (CONCUR 2017), September 2017, Berlin, Germany.
pdf (arXiv version)

S. Akshay,
P. Gastin,
S. Krishna,
I. Sarkar.
Towards an Efficient Tree Automata based technique for Timed Systems.
In the proceedings of the International Conference on Concurrency Theory (CONCUR 2017), September 2017, Berlin, Germany.
pdf (arXiv version)

S. Akshay,
S. Chakraborty,
A. John,
S. Shah.
Towards Parallel Boolean Functional Synthesis
In the proceedings of Tools and Algorithms for the Construction and Analysis of Systems  23rd International Conference, {TACAS} 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 2229, 2017, LNCS vol 10205, pp.337353.
pdf (arXiv version)

S. Akshay,
L. Helouet,
R. Phawade.
Combining Free Choice and Time in Petri Nets
In the proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, {TIME} 2016, Denmark, October 1719, 2016, {IEEE} Computer Society, pp. 120129.

S. Akshay,
P. Gastin,
S. Krishna.
Analyzing Timed Systems Using Tree Automata.
In the proceedings of the 27th International Conference on Concurrency Theory, CONCUR 2016, August 2326, 2016, Quebec City, Canada. LIPIcs 59. pp. 27:1  27:14 pdf (arxiv version)

S. Akshay,
P. Bouyer,
S. Krishna,
L. Manasa,
A. Trivedi.
Stochastic Timed Games Revisited.
In the proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 2226, 2016  Krakow, Poland. LIPIcs 58. pp. 8:18:14.

S. Akshay,
B. Genest,
L. Helouet.
Decidable Classes of Unbounded Petri Nets with Time and Urgency.
In proceedings of the 37th International Conference on Application and Theory of Petri Nets (PETRI NETS), June 2016, Torun, Poland. Springer LNCS 9698, pp. 301  322. pdf (report)

S. Akshay,
B. Genest,
B. Karelovic,
N. Vyas.
On Regularity of unary Probabilistic Automata
In proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS), Feb 2016, Orleans, France. LIPIcs 47, pp. 8:1  8:14. pdf (report)

A. John,
S. Shah,
S. Chakraborty,
A. Trivedi,
S. Akshay.
Skolem Functions for Factored Formulas
In proceedings of the 15th Conference on Formal Methods in ComputerAided Design (FMCAD), Sep 2015, Austin, Texas, USA. pp. 7380. pdf (full version)

S. Akshay,
L. Helouet,
M. Mukund.
Sessions with an unbounded number of agents.
In proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD), 2014, Tunis La Marsa, Tunisia. IEEE Computer Society, pp. 166174.

S. Akshay,
I. Dinca,
B. Genest,
A. Stefanescu.
Implementing realistic asynchronous automata.
In proceedings of the 33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2013, Guwahati, India. Leibniz International Proceedings in Informatics, LiPIcs, Dagstuhl, vol. 24, pp. 213224. pdf  report
 S. Akshay,
N. Bertrand,
S. Haddad,
L. Helouet.
The steadystate control problem for Markov decision processes.
In proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST), 2013, Buenos Aires, Argentina. Springer LNCS, pp. 290304.

M. Agrawal,
S. Akshay,
B. Genest,
P. S. Thiagarajan.
Approximate verification of the symbolic dynamics of Markov chains.
In proceedings of the 27th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS), 2012, Dubrovnik, Croatia. IEEE Computer Society Press, pp. 5564. pdf
 S. Akshay,
L. Helouet,
C. Jard,
D. Lime,
O. H. Roux.
Robustness of time Petri nets under architectural constraints.
In proceedings of the 10th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), 2012, London, UK. Springer LNCS 7595, pp. 1126.
 S. Akshay,
L. Helouet,
C. Jard,
P.A. Reynier.
Robustness of time Petri nets under guard enlargement.
In proceedings of the 6th International Workshop on Reachability Problems (RP), 2012, Bordeaux, France. Springer LNCS 7550, pp. 92106.

S. Akshay,
B. Genest,
L. Helouet,
S. Yang.
Symbolically bounding the drift in timeconstrained MSC graphs.
In proceedings of the 9th International Colloquium on Theoretical Aspects of Computing (ICTAC), 2012, Bangalore, India. Springer LNCS 7521, pp. 115. pdf (Technical report)

S. K. Palaniappan,
S. Akshay,
B. Genest,
P. S. Thiagarajan.
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways.
In proceedings of the 9th International Conference on Computational Methods in Systems Biology (CMSB), 2011, Paris, France. ACM 2011, pp.3544. pdf

S. Akshay,
P. Gastin,
M. Mukund,
K. Narayan Kumar.
Model checking timeconstrained scenariobased specifications.
In proceedings of the 30th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2010, Chennai, India. Leibniz International Proceedings in Informatics, LiPIcs, Dagstuhl, vol. 8, pp. 204215. pdf  Report

S. Akshay,
B. Bollig,
P. Gastin,
M. Mukund,
K. Narayan Kumar.
Distributed timed automata with independently evolving clocks.
In proceedings of the 19th International Conference on Concurrency Theory (CONCUR), 2008, Toronto, Canada. Springer LNCS 5201, pp. 8297. pdf

S. Akshay,
M. Mukund,
K. Narayan Kumar.
Checking coverage for infinite collections of timed scenarios.
In proceedings of the 18th International Conference on Concurrency Theory (CONCUR), 2007, Lisbon, Portugal. Springer LNCS 4703, pp. 181196. pdf

S. Akshay,
B. Bollig,
P. Gastin,
Automata and logics for timed message sequence charts.
In proceedings of the 27th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2007, New Delhi, India. Springer LNCS 4855, pp. 290302. pdf
Back to Top