{"id":418,"date":"2013-03-02T16:55:02","date_gmt":"2013-03-02T15:55:02","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/?page_id=418"},"modified":"2017-01-13T15:51:33","modified_gmt":"2017-01-13T14:51:33","slug":"publications","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<h2>2016<\/h2>\n<ul>\n<li>C. Aiswarya, P. Gastin, P. Saivasan, <a title=\"Nested words for order-2 pushdown systems\" href=\"https:\/\/arxiv.org\/abs\/1609.06290\">Nested words for order-2 pushdown systems<\/a>. CoRR abs\/1609.06290.<\/li>\n<li>S. Akshay, P. Bouyer, S. Krishna, L. Manasa, A. Trivedi, <a title=\"Stochastic timed games revisited\" href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/6498\/pdf\/LIPIcs-MFCS-2016-8.pdf\">Stochastic timed games revisited<\/a>. Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), LIPIcs 58. pp. 8:1-8:14.<\/li>\n<li>S. Akshay, P. Gastin, S. Krishna, <a title=\"Analyzing Timed Systems Using Tree Automata\" href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/6177\/pdf\/LIPIcs-CONCUR-2016-27.pdf\">Analyzing timed systems using tree automata<\/a>. Proceedings of the 27th International Conference on Concurrency Theory, CONCUR 2016. LIPIcs 59. pp. 27:1 &#8211; 27:14<\/li>\n<li>S. Akshay, B. Genest, L. Helouet. <a href=\"https:\/\/perso.crans.org\/~genest\/AGH16.pdf\">Decidable classes of unbounded Petri nets with time and urgency<\/a>. Proceedings of the 37th International Conference on Application and Theory of Petri Nets (PETRI NETS 2016) Springer LNCS 9698, pp. 301 &#8211; 322.<\/li>\n<li>S. Akshay, B. Genest, B. Karelovic, N. Vyas, <a title=\"On Regularity of unary Probabilistic Automata\" href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/5709\/pdf\/9.pdf\">On regularity of unary probabilistic automata<\/a><br \/>\nProceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). LIPIcs 47, pp. 8:1 &#8211; 8:14.<\/li>\n<li>S. Akshay, L. Helouet, R. Phawade, <a title=\"Combining Free Choice and Time in Petri Nets\" href=\"https:\/\/hal-institut-mines-telecom.archives-ouvertes.fr\/hal-01379440\/\">Combining free choice and time in Petri nets<\/a>. Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning (TIME 2016). IEEE.<\/li>\n<li>S. Akshay, L. H\u00e9lou\u00ebt, C. Jard, and P.-A. Reynier. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-33512-9_9\">Robustness of time Petri nets under guard enlargement<\/a>. Fundam. Inform., 143(3-4):207\u2013234, 2016.<\/li>\n<li>S. Akshay, H\u00e9lou\u00ebt, 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\u2013129. IEEE, 2016.<\/li>\n<li>M. F. Atig, D. Chistikov, P. Hofman, K. Narayan Kumar, P. Saivasan and G. Zetzsche, <a title=\"Complexity of regular abstractions of one-counter languages\" href=\"https:\/\/arxiv.org\/abs\/1602.03419\">Complexity of regular abstractions of one-counter languages<\/a>. Proceedings of Logic in Computer Science (LICS 2016), ACM, pp. 207&#8211;216<\/li>\n<li>S. Bhandari,\u00a0M. 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.<\/li>\n<li>D. Berwanger, A. B. Mathew, <a title=\"Infinite games with finite knowledge gaps\" href=\"https:\/\/arxiv.org\/pdf\/1411.5820v2\">Infinite games with finite knowledge gaps<\/a>. Information and Computation, Elsevier 2016. To appear.<\/li>\n<li>M. Conti, P. Faruki, M. S. Gaur,\u00a0V. Laxmi, A. Zemmari. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/7575351\/?section=abstract\">MimeoDroid: Large Scale Dynamic App analysis on Cloned Devices using Machine Learning Classifiers<\/a>. Proceedings of RSDA Workshop, 46th IEEE\/IFIP International Conference on Dependable Systems and Networks Workshops, pp. 60-65, IEEE, 2016.<\/li>\n<li>M. S. Gaur,\u00a0V. Laxmi, \u00a0V. Rao, G. Singal, \u00a0S. Todi, A. Zemmari.\u00a0MCLSPM: Multi-constraints Link Stable Multicast Routing Protocol in Adhoc Networks. Proceeedings of IFIP Wireless Days 2016, pp. 1-6, IEEE, 2016.<\/li>\n<li>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.<\/li>\n<li>F. Herbreteau, B. Srivathsan, I. Walukiewicz. <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540116300438\">Better Abstractions for Timed Automata<\/a>. Information and Computation, vol. 251, pp. 67-90, 2016.<\/li>\n<li>F. Herbreteau, B. Srivathsan, T.-T. Tran, I. Walukiewicz. <a href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/6883\/pdf\/LIPIcs-FSTTCS-2016-48.pdf\">Why liveness for timed automata is hard, and what we can do about it.<\/a> In Proceedings of\u00a0FSTTCS 2016, LIPIcs 65, pp. 48:1-14, Leibniz Zentrum f\u00fcr Informatik 2016.<\/li>\n<li>P. Karandikar, M. Niewerth and Ph. Schnoebelen,\u00a0<a title=\"On the state complexity of closures and interiors of regular languages with subwords and superwords\" href=\"https:\/\/arxiv.org\/abs\/1406.0690\" target=\"_blank\">On the state complexity of closures and interiors of regular languages with subwords and superwords<\/a>. Theoretical Computer Science 610(A), pages 91-107, Elsevier 2016<\/li>\n<\/ul>\n<h2>2015<\/h2>\n<ul>\n<li>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<\/li>\n<li>C. Aiswarya, B. Bollig and P. Gastin, <a title=\"An Automata-Theoretic Approach to the Verification of Distributed Algorithms\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/ABG-concur15.pdf\" target=\"_blank\">An Automata-Theoretic Approach to the Verification of Distributed Algorithms<\/a>. In Proceedings of CONCUR&rsquo;15, LIPIcs 42, pages 340-353. Leibniz-Zentrum f\u00fcr Informatik, 2015<\/li>\n<li>D. Berwanger, A. B. Mathew, and M. van den Bogaard, <a title=\"Hierarchical information patterns and distributed strategy synthesis\" href=\"https:\/\/arxiv.org\/abs\/1506.03883\" target=\"_blank\">Hierarchical Information Patterns and Distributed Strategy Synthesis<\/a>. In Proceedings of ATVA 2015, LNCS 9364, pages 378-393, Springer, 2015.<\/li>\n<li>D. Berwanger and M. van den Bogaard, <a title=\"Games with Delays. A Frankenstein Approach\" href=\"https:\/\/lsv.ens-paris-saclay.fr\/~dwb\/delays.pdf\" target=\"_blank\"> Games with Delays. A Frankenstein Approach<\/a>. In Proceedings of FSTTCS 2015, LIPIcs 45, pages 307-319, Leibniz Zentrum f\u00fcr Informatik, 2015.<\/li>\n<li>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\u00fcr Informatik, 2015.<\/li>\n<li>P. Karandikar and Ph. Schnoebelen, <a title=\"Generalized Post Embedding Problems\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/KS-msttocs14.pdf\" target=\"_blank\">Generalized Post Embedding Problems<\/a>. Theory of Computing Systems 56(4), pages 697-716, 2015<\/li>\n<li>P. Jancar, P. Karandikar, and Ph. Schnoebelen, <a title=\"On Reachability for Unidirectional Channel Systems Extended with Regular Tests\" href=\"https:\/\/arxiv.org\/abs\/1406.5067\" target=\"_blank\">On Reachability for Unidirectional Channel Systems Extended with Regular Tests<\/a>. Logical Methods in Computer Science 11(2:2), 2015<\/li>\n<li>P. Karandikar, M. Kufleitner and Ph. Schnoebelen,\u00a0<a title=\" On the index of Simon's congruence for piecewise testability\" href=\"https:\/\/arxiv.org\/abs\/1310.1278\" target=\"_blank\">On the index of Simon&rsquo;s congruence for piecewise testability<\/a>. Information Processing Letters 15(4), pages 515-519, 2015<\/li>\n<li>P. Karandikar. Subwords: automata, embedding problems, and verification. PhD Thesis, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France and Chennai Mathematical Institute, India, February 2015.<\/li>\n<li>M. Mukund, G. Shenoy R., and S. P. Suresh, <a title=\"Bounded Implementations of Replicated Data Types\" href=\"https:\/\/www.cmi.ac.in\/~spsuresh\/pdffiles\/vmcai2015.pdf\" target=\"_blank\"> Bounded Implementations of Replicated Data Types<\/a>. In Proceedings of VMCAI&rsquo;15, LNCS 8931, pages 355-372. Springer, 2015<\/li>\n<li>M. Mukund, G. Shenoy R., and S. P. Suresh, <a title=\"Effective Verification of Replicated Data Types Using Later Appearance Records (LAR)\" href=\"https:\/\/www.cmi.ac.in\/~spsuresh\/pdffiles\/crdt-lar.pdf\" target=\"_blank\"> Effective Verification of Replicated Data Types Using Later Appearance Records (LAR) <\/a>. In Proceedings of ATVA 2015, LNCS 9364, pages 293-308. Springer, 2015<\/li>\n<li>M. Praveen, B. Srivathsan. Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? In Proceedings of\u00a0PODS 2015: pages 159-172, ACM 2015.<\/li>\n<li>H. Straubing and P. Weil. <a href=\"https:\/\/arxiv.org\/abs\/1502.03951\" target=\"_blank\">Varieties<\/a>, in Handbook of automata theory, J.-\u00c9 Pin, ed., to appear.<\/li>\n<\/ul>\n<h2>2014<\/h2>\n<ul>\n<li>C. Aiswarya and Paul Gastin,\u00a0<a title=\"Reasoning About Distributed Systems: WYSIWYG\" href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2014\/4828\/\" target=\"_blank\">Reasoning About Distributed Systems: WYSIWYG<\/a>. Proc. of the 34th Int\u2019l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS&rsquo;14), pages 11-30. LIPIcs 29, Schloss Dagstuhl &#8211; Leibniz Zentrum f\u00fcr Informatik, 2014.<\/li>\n<li>C. Aiswarya,\u00a0Paul Gastin\u00a0and\u00a0K. Narayan\u00a0Kumar.\u00a0\u00a0<a title=\"Verifying Communicating Multi-pushdown Systems via Split-width\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/AGN-atva14.pdf\" target=\"_blank\">Verifying Communicating Multi-pushdown Systems via Split-width<\/a>.\u00a0\u00a0<em>In<\/em>\u00a0Proc. of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA&rsquo;14), pages\u00a01-17. LNCS\u00a08837, Springer Verlag,\u00a02014.<\/li>\n<li>C. Aiswarya, Paul Gastin, K. Narayan Kumar. <a title=\"Controllers for the Verification of Communicating Multi-Pushdown Systems\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/CGK-concur14.pdf\" target=\"_blank\">Controllers for the Verification of Communicating Multi-Pushdown Systems<\/a>. Proc. 25th International Conference on Concurrency Theory (CONCUR&rsquo;14), pages 297-311, LNCS 8704. Springer Verlag, 2014. &lt;<a title=\"hal-01057525\" href=\"https:\/\/hal.inria.fr\/hal-01057525\/en\">hal-01057525<\/a>&gt;<\/li>\n<li>S. Akshay,\u00a0Benedikt Bollig,\u00a0Paul Gastin,\u00a0Madhavan Mukund\u00a0and\u00a0K. Narayan\u00a0Kumar.\u00a0\u00a0<a title=\"Distributed Timed Automata with Independently Evolving Clocks\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/ABGMN-fi13.pdf\" target=\"_blank\">Distributed Timed Automata with Independently Evolving Clocks<\/a>.\u00a0\u00a0Fundamenta Informaticae\u00a0130(4), pages\u00a0377-407,\u00a02014.<\/li>\n<li>Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan:<br \/>\n<a title=\"On Bounded Reachability Analysis of Shared Memory Systems\" href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2014\/4875\/\" target=\"_blank\">On Bounded Reachability Analysis of Shared Memory Systems<\/a>. Proc. 34th Int\u2019l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS&rsquo;14), pages 611-623. LIPICS 29, Schloss Dagstuhl &#8211; Leibniz Zentrum f\u00fcr Informatik, 2014.<\/li>\n<li>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.<\/li>\n<li>Dietmar Berwanger and Anup Basil Mathew: <a title=\"Infinite games with finite knowledge gaps\" href=\"https:\/\/arxiv.org\/abs\/1411.5820\">Infinite games with finite knowledge gaps<\/a>, CoRR abs\/1411.5820 (2014). Preliminary version <a title=\"Games with recurring certainty\" href=\"https:\/\/arxiv.org\/abs\/1404.7770\">Games with recurring certainty<\/a> in Proc. 2nd International Workshop on Strategic Reasoning SR 2014.<\/li>\n<li>Benedikt Bollig, Aiswarya Cyriac, Paul Gastin\u00a0and\u00a0Marc Zeitoun:\u00a0<a title=\"Temporal logics for concurrent recursive programs: Satisfiability and model checking\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/BCGZ-jal14.pdf\" target=\"_blank\">Temporal logics for concurrent recursive programs: Satisfiability and model checking<\/a>.\u00a0\u00a0Journal of Applied Logic\u00a012(4), pages\u00a0395-416,\u00a02014.<\/li>\n<li>Benedikt Bollig, Paul Gastin, Akshay Kumar: <a title=\"Parameterized Communicating Automata: Complementation and Model Checking\" href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01030765\" target=\"_blank\">Parameterized Communicating Automata: Complementation and Model Checking<\/a>. Proc. 34th Int&rsquo;l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS&rsquo;14), pages 625-637. LIPICS 29, Schloss Dagstuhl &#8211; Leibniz Zentrum f\u00fcr Informatik, 2014.<\/li>\n<li>Aakash Deshpande, Fr\u00e9d\u00e9ric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz. Fast detection of cycles in timed automata. <a href=\"https:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1410.html#DeshpandeHSTW14\" target=\"_blank\">CoRR abs\/1410.4509<\/a> (2014).<\/li>\n<li><span style=\"line-height: 1.714285714; font-size: 1rem;\">P. Karandikar and Ph. Schnoebelen. <\/span><a style=\"line-height: 1.714285714; font-size: 1rem;\" title=\"On the state complexity of closures and interiors of regular languages with subwords\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/~phs\/publis-phs.php?onlykey=KS-dcfs2014\">On the state complexity of closures and interiors of regular languages with subwords<\/a><span style=\"line-height: 1.714285714; font-size: 1rem;\">. Proc. 16th Workshop on Descriptional Complexity of Formal Systems DCFS&rsquo;14, LNCS 8614, pages 234-245. Springer 2014.<\/span><\/li>\n<li>J\u00e9r\u00f4me Leroux, M. Praveen, Gr\u00e9goire Sutre. Hyper-Ackermannian bounds for pushdown vector addition systems. Proceedings of\u00a0<a href=\"https:\/\/dblp.uni-trier.de\/db\/conf\/csl\/csl2014.html#LerouxPS14\" target=\"_blank\">CSL-LICS 2014<\/a>: 63:1-63:10.<\/li>\n<li>Madhavan Mukund, Gautham Shenoy R., and S.P. Suresh: <a title=\"Optimized OR-Sets Without Ordering Constraints\" href=\"https:\/\/www.cmi.ac.in\/~spsuresh\/pdffiles\/oorsets.pdf\" target=\"_blank\">Optimized OR-Sets Without Ordering Constraints<\/a>. Proc. 15th International Conference on Distributed Computint and Networking DCN 2014. LNCS 8314, pages 227-241. Springer-Verlag, 2014.<\/li>\n<\/ul>\n<h2>2013<\/h2>\n<ul>\n<li>Manindra Agrawal, S. Akshay, Blaise Genest, and P. S. Thiagarajan: Approximate Verification of the Symbolic Dynamics of Markov Chains, to appear in JACM.<\/li>\n<li>S. Akshay,\u00a0Benedikt Bollig\u00a0and\u00a0Paul Gastin.\u00a0\u00a0<a title=\"Event-clock Message Passing Automata: A\u00a0Logical Characterization and an Emptiness-Checking Algorithm\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/ABG-fmsd12.pdf\" target=\"_blank\">Event-clock Message Passing Automata: A\u00a0Logical Characterization and an Emptiness-Checking Algorithm<\/a>.\u00a0\u00a0Formal Methods in System Design\u00a042(3), pages\u00a0262-300,\u00a02013.<\/li>\n<li>S. Akshay, Ionut Dinca, Blaise Genest, and Alin Stefanescu: Implementing Realistic Asynchronous Automata. FSTTCS 2013. To appear.<\/li>\n<li>Arjun Arul and Julien Reichert: <a title=\"Complexity of robot games on the integer line\" href=\"https:\/\/arxiv.org\/abs\/1301.7700v4\" target=\"_blank\">The complexity of robot games on the integer line<\/a>. Proceedings of Quantitative Aspects of Programming Languages and Systems (QAPL 2013). EPTCS 117, 2013, pp. 132-148.<\/li>\n<li>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&rsquo;13), LNCS 7907, pages 58-69, Springer, 2013.<\/li>\n<li>Benedikt Bollig,\u00a0Aiswarya Cyriac,\u00a0Lo\u00efc H\u00e9lou\u00ebt,\u00a0Ahmet Kara and Thomas Schwentick:\u00a0 <a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/BCHKS-lata13.pdf\">Dynamic Communicating Automata and Branching High-Level MSCs<\/a>. Proceedings of <acronym title=\"Proceedings of the 7th International Conference on Language and Automata Theory and Applications (LATA'13), Bilbao, Spain, April 2013\">Language and Automata Theory and Applications (LATA&rsquo;13)<\/acronym>, LNCS 7810, pages\u00a0177-189. Springer,\u00a02013.<\/li>\n<li>Jean-Michel Couvreur, Denis Poitrenaud, <span class=\"il\">Pascal<\/span> <span class=\"il\">Weil<\/span>. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-00688138\" target=\"_blank\">Branching processes for general Petri nets<\/a>, Fundamenta Informatic\u00e6 120, pages 31-58,\u00a0Polish Mathematical Society 2013.<\/li>\n<li>Gilles Geeraerts, Alexander Heu\u00dfner, M. Praveen, Jean-Fran\u00e7ois Raskin. \u03c9-Petri Nets. In Proceedings of\u00a0Petri Nets 2013, pages\u00a049-69.<\/li>\n<li>Fr\u00e9d\u00e9ric Herbreteau, B. Srivathsan, Igor Walukiewicz. Lazy Abstractions for Timed Automata. CAV 2013,\u00a0LNCS\u00a08044, pages 990-1005, Springer 2013.<\/li>\n<li>Siddharth Krishna and Anca Muscholl: <a title=\"A quadratic construction for Zielonka automata with acyclic communication structure\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397513005185\" target=\"_blank\">A quadratic construction for Zielonka automata with acyclic communication structure<\/a>. Theor. Comput. Sci. 503: 109-114 (2013)<\/li>\n<li>Prateek Karandikar,\u00a0Sylvain Schmitz:\u00a0The Parametric Ordinal-Recursive Complexity of Post Embedding Problems.\u00a0FoSSaCS 2013, LNCS 7794, \u00a0pages\u00a0273-288, Springer, 2013.<\/li>\n<li>Prateek Karandikar,\u00a0Philippe Schnoebelen:\u00a0On the index of Simon&rsquo;s congruence for piecewise testability.\u00a0<a href=\"https:\/\/www.informatik.uni-trier.de\/~ley\/db\/journals\/corr\/corr1310.html#KarandikarS13\">CoRR abs\/1310.1278<\/a>\u00a0(2013).<\/li>\n<li>\n<div>J\u00e9r\u00f4me Leroux, M. Praveen, and\u00a0Gr\u00e9goire 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.<\/div>\n<\/li>\n<li>Thomas Place, Lorijn van Rooijen, and Marc Zeitoun. <a href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/4386\/\" target=\"_blank\">Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages<\/a>. In Proceedings of\u00a0FSTTCS 2013, Leibniz International Proceedings in Informatics (LIPIcs) 24, pages 363-375, Leibniz-Zentrum f\u00fcr Informatik.<\/li>\n<li>Sylvain Salvati, Igor Walukiewicz. <a href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/4365\/\" target=\"_blank\">Evaluation is MSOL-compatible<\/a>.In Proceedings of\u00a0FSTTCS 2013, Leibniz International Proceedings in Informatics (LIPIcs) 24, pages\u00a0103-114,\u00a0, Leibniz-Zentrum f\u00fcr Informatik.<\/li>\n<\/ul>\n<h1>2012<\/h1>\n<ul>\n<li>Anudhyan Boral, Sylvain Schmitz: <a title=\"PDL Model Checking Parse Forests - ArXiv\" href=\"https:\/\/arxiv.org\/abs\/1211.5256\">PDL model checking of parse forests<\/a>. CoRR abs\/1211.5256 (2012).<\/li>\n<li>Mohamed Faouzi Atig, A. Bouajjani, K. Narayan Kumar and P. Saivasan, Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding.\u00a0 In ATVA\u201912, LNCS 7561, pages 152-166. Springer, 2012.<\/li>\n<li>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).<\/li>\n<li>Aiswarya Cyriac, Paul Gastin and K. Narayan Kumar, MSO Decidability of Multi-Pushdown Systems via Split-Width. In CONCUR\u201912, LNCS 7454, pages 547-561. Springer, 2012.<\/li>\n<li><a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/~bollig\/\">Benedikt Bollig<\/a>,\u00a0<a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/~cyriac\/\">Aiswarya Cyriac<\/a>,\u00a0<a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/~gastin\/\">Paul Gastin<\/a>\u00a0and\u00a0<a href=\"https:\/\/www.cmi.ac.in\/~kumar\/\">K. Narayan\u00a0Kumar<\/a>.\u00a0\u00a0<a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/BCGK-fossacs12.pdf\">Model Checking Languages of Data Words<\/a>.\u00a0\u00a0<em>In<\/em>\u00a0 <acronym title=\"Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), Tallinn, Estonia, March 2012\">FoSSaCS&rsquo;12<\/acronym>, LNCS\u00a07213, pages\u00a0391-405. Springer,\u00a02012.<\/li>\n<li>Fabrice Chevalier, Deepak D\u2019Souza, Raj Mohan Matteplackel, Pavithra Prabhakar. Automata and logics over signals. In Modern applications of automata theory (D. D&rsquo;Souza, Priti Shankar eds), IISc Research Monographs 2, World Scientific (2012), pages 555-584.<\/li>\n<li>St\u00e9phane Demri, Paul Gastin. Specification and verification using temporal logics,\u00a0in Modern applications of automata theory (D. D&rsquo;Souza, Priti Shankar eds), IISc Research Monographs 2, World Scientific (2012), pages 457-494.<\/li>\n<li>Fr\u00e9d\u00e9ric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient emptiness check for timed B\u00fcchi automata. Formal Methods in System Design 40(2), pages 122-146, Springer 2012.<\/li>\n<li>Fr\u00e9d\u00e9ric Herbreteau, B. Srivathsan, Igor Walukiewicz. Better Abstractions for Timed Automata. In Proceedings of LICS 2012, pages 375-384. IEEE 2012<\/li>\n<li>Alexander Heu\u00dfner, Tristan Le Gall, Gr\u00e9goire 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\u00fcr Informatik, 2012.<\/li>\n<li>Petr Jancar, Prateek Karandikar and Philippe Schnoebelen, <a title=\"Unidirectional channel systems can be tested\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/JKS-ifiptcs12.pdf\" target=\"_blank\">Unidirectional channel systems can be tested<\/a>. In Proceedings of IFIP TCS&rsquo;12, LNCS 7604, pages 149-163. Springer, 2012.<\/li>\n<li>Prateek Karandikar, Sylvain Schmitz, The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. CoRR abs\/1211.5259 (2012).<\/li>\n<li>Prateek Karandikar and Philippe Schnoebelen, <a title=\"Cutting Through Regular Post Embedding Problems\" href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/KS-csr12.pdf\" target=\"_blank\">Cutting Through Regular Post Embedding Problems<\/a>. In Proceedings of CSR&rsquo;12, LNCS 7353, pages 229-240. Springer, 2012.<\/li>\n<li>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\u00fcr Informatik, 2012.<\/li>\n<li>Manfred Kufleitner, <span class=\"il\">Pascal<\/span> <span class=\"il\">Weil<\/span>. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-00567171\/fr\/\" target=\"_blank\">On logical hierarchies within FO<sup>2<\/sup>-definable languages<\/a>, Logical Methods in Computer Science 8 (3:11) pages 1-30, 2012. <a href=\"https:\/\/dx.doi.org\/10.2168\/LMCS-8(3:11)2012\" target=\"_blank\">DOI:10.2168\/LMCS-8(3:11)2012<\/a> .<\/li>\n<li>Howard Straubing, <span class=\"il\">Pascal<\/span> <span class=\"il\">Weil<\/span>. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-00541028\/fr\/\" target=\"_blank\">An introduction to finite automata and their connection to logic<\/a>,\u00a0In Modern applications of automata theory (D. D&rsquo;Souza, Priti Shankar eds), IISc Research Monographs 2, \u00a0pages 3-43, World Scientific 2012.<\/li>\n<li>B. Srivathsan, Igor Walukiewicz. An alternate proof of Statman&rsquo;s finite completeness theorem. Information Processing Letters 112(14-15), pages 612-616, Elsevier 2012.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":5,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-418","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/pages\/418","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/comments?post=418"}],"version-history":[{"count":83,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/pages\/418\/revisions"}],"predecessor-version":[{"id":637,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/pages\/418\/revisions\/637"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/informel\/wp-json\/wp\/v2\/media?parent=418"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}