Publications
Conferences
-
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. 55-64. 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. 11-26.
- 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. 92-106.
-
S. Akshay,
B. Genest,
L. Helouet,
S. Yang.
Symbolically bounding the drift in time-constrained MSC graphs.
In proceedings of the 9th International Colloquium on Theoretical Aspects of Computing (ICTAC), 2012, Bangalore, India. Springer LNCS 7521, pp. 1-15. 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.35-44. pdf
-
S. Akshay,
P. Gastin,
M. Mukund,
K. Narayan Kumar.
Model checking time-constrained scenario-based 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. 204-215. 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. 82-97. 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. 181-196. 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. 290-302. pdf
Journals
-
S. Akshay,
B. Bollig,
P. Gastin.
Event-clock Message Passing Automata: A logical characterization and an emptiness checking algorithm.
In Formal Methods in Systems Design. Springer, 2012. To appear.
-
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, 2012, Pages 1352-1365.
pdf
-
S. Akshay,
B. Genest,
L. Helouet.
S. Yang.
Regular sets of representatives for Time-Constrained MSC Graphs.
In Information Processing Letters, Elsevier, Volume 112, Issues 14-15, 15 August 2012, Pages 592-598. pdf (INRIA-HAL Research Report No.7823, Nov 2011.)
-
S. Akshay,
B. Bollig,
P. Gastin,
M. Mukund,
K. Narayan Kumar.
Distributed timed automata with independently evolving clocks.
Submitted.