2016

• C. Aiswarya, P. Gastin, P. Saivasan, Nested words for order-2 pushdown systems. CoRR abs/1609.06290.
• S. Akshay, P. Bouyer, S. Krishna, L. Manasa, A. Trivedi, Stochastic timed games revisited. Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), LIPIcs 58. pp. 8:1-8:14.
• S. Akshay, P. Gastin, S. Krishna, Analyzing timed systems using tree automata. Proceedings of the 27th International Conference on Concurrency Theory, CONCUR 2016. LIPIcs 59. pp. 27:1 – 27:14
• S. Akshay, B. Genest, L. Helouet. Decidable classes of unbounded Petri nets with time and urgency. Proceedings of the 37th International Conference on Application and Theory of Petri Nets (PETRI NETS 2016) Springer LNCS 9698, pp. 301 – 322.
• S. Akshay, B. Genest, B. Karelovic, N. Vyas, On regularity of unary probabilistic automata
  Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). LIPIcs 47, pp. 8:1 – 8:14.
• S. Akshay, L. Helouet, R. Phawade, Combining free choice and time in Petri nets. Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning (TIME 2016). IEEE.
• S. Akshay, L. Hélouët, C. Jard, and P.-A. Reynier. Robustness of time Petri nets under guard enlargement. Fundam. Inform., 143(3-4):207–234, 2016.
• S. Akshay, Hélouët, and Ramchandra Phawade. Combining free choice and time in Petri nets. In Curtis E. Dyreson, Michael R. Hansen, and Luke Hunsberger (eds), 23rd International Symposium on Temporal Representation and Reasoning, TIME 2016, Kongens Lyngby, Denmark, October 17-19, 2016, pages 120–129. IEEE, 2016.
• M. F. Atig, D. Chistikov, P. Hofman, K. Narayan Kumar, P. Saivasan and G. Zetzsche, Complexity of regular abstractions of one-counter languages. Proceedings of Logic in Computer Science (LICS 2016), ACM, pp. 207–216
• S. Bhandari, M. S. Gaur, V. Laxmi, A. Zemmari. Intersection Automata based Model for Android Application Collusion, Proceedings of 30th IEEE International Conference on Advanced Information Networking and Applications, pp. 901-908, IEEE Computer Society, 2016.
• D. Berwanger, A. B. Mathew, Infinite games with finite knowledge gaps. Information and Computation, Elsevier 2016. To appear.
• M. Conti, P. Faruki, M. S. Gaur, V. Laxmi, A. Zemmari. MimeoDroid: Large Scale Dynamic App analysis on Cloned Devices using Machine Learning Classifiers. Proceedings of RSDA Workshop, 46th IEEE/IFIP International Conference on Dependable Systems and Networks Workshops, pp. 60-65, IEEE, 2016.
• M. S. Gaur, V. Laxmi,  V. Rao, G. Singal,  S. Todi, A. Zemmari. MCLSPM: Multi-constraints Link Stable Multicast Routing Protocol in Adhoc Networks. Proceeedings of IFIP Wireless Days 2016, pp. 1-6, IEEE, 2016.
• V. Jain, M. S. Gaur, V. Laxmi, M. Mosbah. Detection of Vulnerable Android Apps arising from Database Implementations. Proceedings of the International Conference on Information Systems Security (ICISS-2016), Lecture Notes in Computer Science, vol. 10063, Springer, 2016. To appear.
• F. Herbreteau, B. Srivathsan, I. Walukiewicz. Better Abstractions for Timed Automata. Information and Computation, vol. 251, pp. 67-90, 2016.
• F. Herbreteau, B. Srivathsan, T.-T. Tran, I. Walukiewicz. Why liveness for timed automata is hard, and what we can do about it. In Proceedings of FSTTCS 2016, LIPIcs 65, pp. 48:1-14, Leibniz Zentrum für Informatik 2016.
• P. Karandikar, M. Niewerth and Ph. Schnoebelen, On the state complexity of closures and interiors of regular languages with subwords and superwords. Theoretical Computer Science 610(A), pages 91-107, Elsevier 2016

2015

• S. Akshay, P. Gastin, M. Mukund, and K. Narayan Kumar, Checking conformance for time-constrained scenario-based specifications. Theoretical Computer Science 594, pages 24-43, Elsevier 2015
• C. Aiswarya, B. Bollig and P. Gastin, An Automata-Theoretic Approach to the Verification of Distributed Algorithms. In Proceedings of CONCUR’15, LIPIcs 42, pages 340-353. Leibniz-Zentrum für Informatik, 2015
• D. Berwanger, A. B. Mathew, and M. van den Bogaard, Hierarchical Information Patterns and Distributed Strategy Synthesis. In Proceedings of ATVA 2015, LNCS 9364, pages 378-393, Springer, 2015.
• D. Berwanger and M. van den Bogaard, Games with Delays. A Frankenstein Approach. In Proceedings of FSTTCS 2015, LIPIcs 45, pages 307-319, Leibniz Zentrum für Informatik, 2015.
• P. Karandikar and Ph. Schnoebelen, Decidability in the logic of subsequences and super sequences. In Proceedings of FSTTCS 2015, LIPIcs 45, pages 84-97, Leibniz Zentrum für Informatik, 2015.
• P. Karandikar and Ph. Schnoebelen, Generalized Post Embedding Problems. Theory of Computing Systems 56(4), pages 697-716, 2015
• P. Jancar, P. Karandikar, and Ph. Schnoebelen, On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Logical Methods in Computer Science 11(2:2), 2015
• P. Karandikar, M. Kufleitner and Ph. Schnoebelen, On the index of Simon’s congruence for piecewise testability. Information Processing Letters 15(4), pages 515-519, 2015
• P. Karandikar. Subwords: automata, embedding problems, and verification. PhD Thesis, Laboratoire Spécification et Vérification, ENS Cachan, France and Chennai Mathematical Institute, India, February 2015.
• M. Mukund, G. Shenoy R., and S. P. Suresh, Bounded Implementations of Replicated Data Types. In Proceedings of VMCAI’15, LNCS 8931, pages 355-372. Springer, 2015
• M. Mukund, G. Shenoy R., and S. P. Suresh, Effective Verification of Replicated Data Types Using Later Appearance Records (LAR) . In Proceedings of ATVA 2015, LNCS 9364, pages 293-308. Springer, 2015
• M. Praveen, B. Srivathsan. Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? In Proceedings of PODS 2015: pages 159-172, ACM 2015.
• H. Straubing and P. Weil. Varieties, in Handbook of automata theory, J.-É Pin, ed., to appear.

2014

• C. Aiswarya and Paul Gastin, Reasoning About Distributed Systems: WYSIWYG. Proc. of the 34th Int’l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), pages 11-30. LIPIcs 29, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2014.
• C. Aiswarya, Paul Gastin and K. Narayan Kumar.  Verifying Communicating Multi-pushdown Systems via Split-width.  In Proc. of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA’14), pages 1-17. LNCS 8837, Springer Verlag, 2014.
• C. Aiswarya, Paul Gastin, K. Narayan Kumar. Controllers for the Verification of Communicating Multi-Pushdown Systems. Proc. 25th International Conference on Concurrency Theory (CONCUR’14), pages 297-311, LNCS 8704. Springer Verlag, 2014. <hal-01057525>
• S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund and K. Narayan Kumar.  Distributed Timed Automata with Independently Evolving Clocks.  Fundamenta Informaticae 130(4), pages 377-407, 2014.
• Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan:
  On Bounded Reachability Analysis of Shared Memory Systems. Proc. 34th Int’l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), pages 611-623. LIPICS 29, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2014.
• Mohamed Faouzi Atig, K. Narayan Kumar, and Prakash Saivasan, Adjacent Ordered Multi-Pushdown Systems. Int. J. Found. Comput. Sci. 25(8), pages 1083-1096, World Scientific, 2014.
• Dietmar Berwanger and Anup Basil Mathew: Infinite games with finite knowledge gaps, CoRR abs/1411.5820 (2014). Preliminary version Games with recurring certainty in Proc. 2nd International Workshop on Strategic Reasoning SR 2014.
• Benedikt Bollig, Aiswarya Cyriac, Paul Gastin and Marc Zeitoun: Temporal logics for concurrent recursive programs: Satisfiability and model checking.  Journal of Applied Logic 12(4), pages 395-416, 2014.
• Benedikt Bollig, Paul Gastin, Akshay Kumar: Parameterized Communicating Automata: Complementation and Model Checking. Proc. 34th Int’l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), pages 625-637. LIPICS 29, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2014.
• Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz. Fast detection of cycles in timed automata. CoRR abs/1410.4509 (2014).
• P. Karandikar and Ph. Schnoebelen. On the state complexity of closures and interiors of regular languages with subwords. Proc. 16th Workshop on Descriptional Complexity of Formal Systems DCFS’14, LNCS 8614, pages 234-245. Springer 2014.
• Jérôme Leroux, M. Praveen, Grégoire Sutre. Hyper-Ackermannian bounds for pushdown vector addition systems. Proceedings of CSL-LICS 2014: 63:1-63:10.
• Madhavan Mukund, Gautham Shenoy R., and S.P. Suresh: Optimized OR-Sets Without Ordering Constraints. Proc. 15th International Conference on Distributed Computint and Networking DCN 2014. LNCS 8314, pages 227-241. Springer-Verlag, 2014.

2013

• Manindra Agrawal, S. Akshay, Blaise Genest, and P. S. Thiagarajan: Approximate Verification of the Symbolic Dynamics of Markov Chains, to appear in JACM.
• S. Akshay, Benedikt Bollig and Paul Gastin.  Event-clock Message Passing Automata: A Logical Characterization and an Emptiness-Checking Algorithm.  Formal Methods in System Design 42(3), pages 262-300, 2013.
• S. Akshay, Ionut Dinca, Blaise Genest, and Alin Stefanescu: Implementing Realistic Asynchronous Automata. FSTTCS 2013. To appear.
• Arjun Arul and Julien Reichert: The complexity of robot games on the integer line. Proceedings of Quantitative Aspects of Programming Languages and Systems (QAPL 2013). EPTCS 117, 2013, pp. 132-148.
• M.F.Atig, K. Narayan Kumar and P. Saivasan: Adjacent Ordered Multi-pushdown Systems. Proceedings of the 17th International Conference on Developments in Language Theory (DLT’13), LNCS 7907, pages 58-69, Springer, 2013.
• Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara and Thomas Schwentick:  Dynamic Communicating Automata and Branching High-Level MSCs. Proceedings of Language and Automata Theory and Applications (LATA’13), LNCS 7810, pages 177-189. Springer, 2013.
• Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil. Branching processes for general Petri nets, Fundamenta Informaticæ 120, pages 31-58, Polish Mathematical Society 2013.
• Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin. ω-Petri Nets. In Proceedings of Petri Nets 2013, pages 49-69.
• Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Lazy Abstractions for Timed Automata. CAV 2013, LNCS 8044, pages 990-1005, Springer 2013.
• Siddharth Krishna and Anca Muscholl: A quadratic construction for Zielonka automata with acyclic communication structure. Theor. Comput. Sci. 503: 109-114 (2013)
• Prateek Karandikar, Sylvain Schmitz: The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. FoSSaCS 2013, LNCS 7794,  pages 273-288, Springer, 2013.
• Prateek Karandikar, Philippe Schnoebelen: On the index of Simon’s congruence for piecewise testability. CoRR abs/1310.1278 (2013).
• Jérôme Leroux, M. Praveen, and Grégoire Sutre. A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. In Proceedings of CONCUR 2013, LNCS 8052, pages 137-151, Springer 2013.
• Thomas Place, Lorijn van Rooijen, and Marc Zeitoun. Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. In Proceedings of FSTTCS 2013, Leibniz International Proceedings in Informatics (LIPIcs) 24, pages 363-375, Leibniz-Zentrum für Informatik.
• Sylvain Salvati, Igor Walukiewicz. Evaluation is MSOL-compatible.In Proceedings of FSTTCS 2013, Leibniz International Proceedings in Informatics (LIPIcs) 24, pages 103-114, , Leibniz-Zentrum für Informatik.

2012

• Anudhyan Boral, Sylvain Schmitz: PDL model checking of parse forests. CoRR abs/1211.5256 (2012).
• Mohamed Faouzi Atig, A. Bouajjani, K. Narayan Kumar and P. Saivasan, Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding.  In ATVA’12, LNCS 7561, pages 152-166. Springer, 2012.
• Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan, Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard. CoRR abs/1205.6928 (2012).
• Aiswarya Cyriac, Paul Gastin and K. Narayan Kumar, MSO Decidability of Multi-Pushdown Systems via Split-Width. In CONCUR’12, LNCS 7454, pages 547-561. Springer, 2012.
• Benedikt Bollig, Aiswarya Cyriac, Paul Gastin and K. Narayan Kumar.  Model Checking Languages of Data Words.  In  FoSSaCS’12, LNCS 7213, pages 391-405. Springer, 2012.
• Fabrice Chevalier, Deepak D’Souza, Raj Mohan Matteplackel, Pavithra Prabhakar. Automata and logics over signals. In Modern applications of automata theory (D. D’Souza, Priti Shankar eds), IISc Research Monographs 2, World Scientific (2012), pages 555-584.
• Stéphane Demri, Paul Gastin. Specification and verification using temporal logics, in Modern applications of automata theory (D. D’Souza, Priti Shankar eds), IISc Research Monographs 2, World Scientific (2012), pages 457-494.
• Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient emptiness check for timed Büchi automata. Formal Methods in System Design 40(2), pages 122-146, Springer 2012.
• Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Better Abstractions for Timed Automata. In Proceedings of LICS 2012, pages 375-384. IEEE 2012
• Alexander Heußner, Tristan Le Gall, Grégoire Sutre. Safety Verification of Communicating One-Counter Machines. In Proceedings of FSTTCS 2012, Leibniz International Proceedings in Informatics (LIPIcs) 18, pages 224-235, Leibniz-Zentrum für Informatik, 2012.
• Petr Jancar, Prateek Karandikar and Philippe Schnoebelen, Unidirectional channel systems can be tested. In Proceedings of IFIP TCS’12, LNCS 7604, pages 149-163. Springer, 2012.
• Prateek Karandikar, Sylvain Schmitz, The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. CoRR abs/1211.5259 (2012).
• Prateek Karandikar and Philippe Schnoebelen, Cutting Through Regular Post Embedding Problems. In Proceedings of CSR’12, LNCS 7353, pages 229-240. Springer, 2012.
• Manfred Kufleitner, Pascal Weil. The FO2 alternation hierarchy is decidable. Proceedings of Computer Science Logic (CSL 2012), Leibniz International Proceedings in Informatics (LIPIcs) 16, pages 426-439, Leibniz-Zentrum für Informatik, 2012.
• Manfred Kufleitner, Pascal Weil. On logical hierarchies within FO²-definable languages, Logical Methods in Computer Science 8 (3:11) pages 1-30, 2012. DOI:10.2168/LMCS-8(3:11)2012 .
• Howard Straubing, Pascal Weil. An introduction to finite automata and their connection to logic, In Modern applications of automata theory (D. D’Souza, Priti Shankar eds), IISc Research Monographs 2,  pages 3-43, World Scientific 2012.
• B. Srivathsan, Igor Walukiewicz. An alternate proof of Statman’s finite completeness theorem. Information Processing Letters 112(14-15), pages 612-616, Elsevier 2012.