Publications

Branch-Well-Structured Transition Systems and Extensions.
B. Bollig, A. Finkel, and A. Suresh.
42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE’22).
To appear.

Bounded Reachability Problems are Decidable in FIFO Machines.
B. Bollig, A. Finkel, and A. Suresh.
Logical Methods in Computer Science (LMCS):Volume 18, Issue 1, January 2022.

A Universal Framework for Deciding Synchronizability.
B. Bollig, C. Di Guisto, A. Finkel, L. Laversa, E. Lozes and A. Suresh.
32nd International Conference on Concurrency Theory (CONCUR’21),Paris, France, August 2021. Best Teaser Talk Award

Bounded Reachability Problems are Decidable in FIFO Machines.
B. Bollig, A. Finkel, and A. Suresh. 31st International Conference on Concurrency Theory (CONCUR’20), volume 171 of Leibniz International Proceedings in Informatics, Vienna, Austria, September 2020. Best Paper Award

Termination, Boundedness and Reachability for Input-bounded FIFO Machines.
A. Suresh.
Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.

Estimation of the Parameters of Solar Cells from Current-Voltage Characteristics using Genetic Algorithm.
S. Puthanveetil, M. Cho, A. Suresh.
International Journal on Soft Computing, Artificial Intelligence and Applications, February 2016.

Professional participation

Program Committee 15th Interaction and Concurrency Experience (ICE’22)

Technical Chair 32nd International Conference on Concurrency Theory (QONFEST’21)

Participant VTSA’21, Journées du GT Vérif ‘21, MOVEP’20, ForMaL’19