Publications : VASCO

[BLRPR21]
V. Bruyère, S. Le Roux, A. Pauly, and J. Raskin. On the existence of weak subgame perfect equilibria. 276, 2021.
doi: https://doi.org/10.1016/j.ic.2020.104553.
[ BibTex | DOI | Web page ]
[BBF+21]
G. Bacci, P. Bouyer, U. Fahrenberg, K. Larsen, N. Markey, and P. Reynier. Optimal and robust controller synthesis using energy timed automata with uncertainty. Formal Aspects of Computing, 33:3--25, 2021.
doi: 10.1007/s00165-020-00521-4.
[ BibTex | DOI | Web page ]
[BRS21]
B. Bollig, F. Ryabinin, and A. Sangnier. Reachability in Distributed Memory Automata. In Proceedings of the 29th Annual EACSL Conference on Computer Science Logic (CSL'21), Leibniz International Proceedings in Informatics, pages 13:1--13:16, Ljubljana, Slovenia, January 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2021.13.
[ BibTex | DOI | Web page | PDF ]
[LRP21]
S. Le Roux and A. Pauly. Equilibria in multi-player multi-outcome infinite sequential games. Information and Computation, 276, 2021.
doi: https://doi.org/10.1016/j.ic.2020.104557.
[ BibTex | DOI | Web page ]
[BBM20]
N. Bertrand, P. Bouyer, and A. Majumdar. Synthesizing safe coalition strategies. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 39:1--39:17, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.39.
[ BibTex | DOI | Web page | PDF ]
[GMS20]
P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability for updatable timed automata made faster and more effective. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 47:1--47:17, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.47.
[ BibTex | DOI | Web page | PDF ]
[AG20]
C. Aiswarya and P. Gastin. Weighted Tiling Systems for Graphs: Evaluation Complexity. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.34.
[ BibTex | DOI | Web page | PDF ]
[For20]
M. Fortin. Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2020.
[ BibTex | Web page | PDF ]
[BKM+20]
P. Bouyer, O. Kupferman, N. Markey, B. Maubert, A. Murano, and G. Perelli. Reasoning About Quality and Fuzziness of Strategic Behaviours. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), pages 2887--2888, Santiago de Compostela, Spain, September 2020. IOS Press.
doi: 10.3233/FAIA200437.
[ BibTex | DOI | Web page | PDF ]
[BBR+20]
P. Bouyer, T. Brihaye, M. Randour, C. Rivière, and P. Vandenhove. Decisiveness of Stochastic Systems and its Application to Hybrid Models. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), volume 326 of Electronic Proceedings in Theoretical Computer Science, page 149?165, Brussels, Belgium, September 2020.
doi: 10.4204/EPTCS.326.10.
[ BibTex | DOI | Web page | PDF ]
[BBB+20]
B. Bérard, B. Bollig, P. Bouyer, M. Függer, and N. Sznajder. Synthesis in Presence of Dynamic Links. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), volume 326 of Electronic Proceedings in Theoretical Computer Science, page 33?49, Brussels, Belgium, September 2020.
doi: 10.4204/EPTCS.326.3.
[ BibTex | DOI | Web page | PDF ]
[BLRO+20]
P. Bouyer, S. Le Roux, Y. Oualhadj, M. Randour, and P. Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, pages 24:1--24:22, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2020.24.
[ BibTex | DOI | Web page ]
[AGSW20]
B. Adsul, P. Gastin, S. Sarkar, and P. Weil. Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, pages 19:1--19:17, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2020.19.
[ BibTex | DOI | Web page ]
[DTFG20]
G. Douéneau-Tabot, E. Filiot, and P. Gastin. Register transducers are marble transducers. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS'20), volume 170 of Leibniz International Proceedings in Informatics, pages 29:1--29:14, Prague, Czech Republic, August 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.MFCS.2020.29.
[ BibTex | DOI | Web page | PDF ]
[AGKR20]
S. Akshay, P. Gastin, S. N. Krishna, and S. Roychoudhary. Revisiting Underapproximate Reachability for Multipushdown Systems. In Proceedings of the 26th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'20), volume 12078 of Lecture Notes in Computer Science, pages 387--404, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45190-5_21.
[ BibTex | DOI | Web page | PDF ]
[BBLS20]
B. Bérard, B. Bollig, M. Lehaut, and N. Sznajder. Parameterized Synthesis for Fragments of First-Order Logic over Data Words. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 97--118, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_6.
[ BibTex | DOI ]
[AVL+20]
N. Alexopoulos, E. Vasilomanolakis, S. Le Roux, S. Rowe, and M. Mühlhäuser. TRIDEnT: Towards a Decentralized Threat Indicator Marketplace. In Proceedings of the 35th ACM/SIGAPP Symposium on Applied Computing (SAC'20), pages 332--341, Brno, Czech Republic, March 2020. ACM Press.
doi: 10.1145/3341105.3374020.
[ BibTex | DOI | Web page ]
[BD20]
D. Berwanger and L. Doyen. Observation and Distinction. Representing Information in Infinite Games. In Proceedings of the 37th Annual Symposium on Theoretical Aspects of Computer Science (STACS'20), Leibniz International Proceedings in Informatics, pages 48:1--48:17, Montpellier, France, March 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2020.48.
[ BibTex | DOI ]
[GBM20]
P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. Theory of Computing Systems, 64(3), 2020.
[ BibTex | Web page | PDF ]
[JFA20a]
J. Jerray, L. Fribourg, and É. André. Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples. Research Report 2006.09993, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]
[JFA20b]
J. Jerray, L. Fribourg, and É. André. Robust optimal control using dynamic programming and guaranteed Euler's method. Research Report 2007.13644, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]
[JF20]
J. Jerray and L. Fribourg. Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems. Research Report 2012.09310, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]
[LR20]
S. Le Roux. Time-Aware Uniformization of Winning Strategies. In Proceedings of the 16th Conference on Computability in Europe (CiE 2020), volume 12098 of Lecture Notes in Computer Science, pages 193--204, Fisciano, Italy, 2020. Springer-Verlag.
doi: https://doi.org/10.1007/978-3-030-51466-2_17.
[ BibTex | DOI | Web page | PDF ]
[LRP20]
S. Le Roux and A. Pauly. A Semi-Potential for Finite and Infinite Games in Extensive Form. Dynamic Games and Applications, 10(1):120--144, 2020.
doi: 10.1007/s13235-019-00301-7.
[ BibTex | DOI | Web page ]
[BGHLR20]
T. Brihaye, G. Geeraerts, M. Hallet, and S. Le Roux. On the termination of dynamics in sequential games. Information and Computation, 272, 2020.
doi: 10.1016/j.ic.2019.104505.
[ BibTex | DOI ]
[BBM19a]
N. Bertrand, P. Bouyer, and A. Majumdar. Concurrent parameterized games. In Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, pages 31:1--31:15, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2019.31.
[ BibTex | DOI | Web page | PDF ]
[LF19a]
A. Le Coënt and L. Fribourg. Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants. In Proceedings of the 58th IEEE Conference on Decision and Control (CDC'19), pages 599--604, Nice, France, December 2019. IEEE Control System Society.
doi: 10.1109/CDC40024.2019.9029376.
[ BibTex | DOI | Web page | PDF ]
[CG19]
A. Chattopadhyay and P. Gastin, editors. Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]
[Gon19]
M. González. Stochastic Games on Graphs with Applications to Smart-Grids Optimization. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2019.
[ BibTex | Web page | PDF ]
[Sao19]
A. Saoud. Compositional and Efficient Controller Synthesis for Cyber-Physical Systems. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, October 2019.
[ BibTex | Web page | PDF ]
[LF19b]
A. Le Coënt and L. Fribourg. Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction. In 9th International Workshop on Cyber Physical Systems (CyPhy'19) and 15th International Workshop on Model-Based Design (WESE'19), Revised Selected Papers, volume 11971 of Lecture Notes in Computer Science, pages 181--202, New York City, NY, USA, October 2019. Springer.
doi: 10.1007/978-3-030-41131-2_9.
[ BibTex | DOI | Web page ]
[Bou19a]
P. Bouyer. A Note on Game Theory and Verification (Invited Talk). In Proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis (ATVA'19), volume 11781 of Lecture Notes in Computer Science, pages 3--22, Taipei, Taiwan, October 2019. Springer.
doi: 10.1007/978-3-030-31784-3_1.
[ BibTex | DOI ]
[Bou19b]
P. Bouyer. On the Computation of Nash Equilibria in Games on Graphs (Invited Talk). In Proceedings of the 26th International Symposium on Temporal Representation and Reasoning (TIME'19), Leibniz International Proceedings in Informatics, pages 3:1--3:3, Málaga, Spain, October 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.TIME.2019.3.
[ BibTex | DOI ]
[DT19]
G. Douéneau-Tabot. Register Models for Pebble Transducers and Applications to Optimization. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
[ BibTex ]
[Jaz19]
S. Jaziri. Automata on Timed Structures. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2019.
[ BibTex | Web page | PDF ]
[GMG19]
P. Gastin, A. Manuel, and R. Govind. Logics for Reversible Regular Languages and Semigroups with Involution. In Proceedings of the 23th International Conference on Developments in Language Theory (DLT'19), volume 11647 of Lecture Notes in Computer Science, pages 182--191, Warsaw, Poland, August 2019. Springer.
doi: 10.1007/978-3-030-24886-4_13.
[ BibTex | DOI | Web page | PDF ]
[DG19]
M. Droste and P. Gastin. Aperiodic Weighted Automata and Weighted First-Order Logic. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'19), volume 138 of Leibniz International Proceedings in Informatics, pages 76:1--76:15, Aachen, Germany, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2019.76.
[ BibTex | DOI | Web page | PDF ]
[BT19]
P. Bouyer and N. Thomasset. Nash equilibria in games over graphs equipped with a communication mechanism. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'19), volume 138 of Leibniz International Proceedings in Informatics, pages 9:1--9:14, Aachen, Germany, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2019.9.
[ BibTex | DOI | Web page | PDF ]
[BBM19b]
N. Bertrand, P. Bouyer, and A. Majumdar. Reconfiguration and message losses in parameterized broadcast networks. In Proceedings of the 30th International Conference on Concurrency Theory (CONCUR'19), volume 140 of Leibniz International Proceedings in Informatics, pages 32:1--32:15, Amsterdam, The Netherlands, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2019.32.
[ BibTex | DOI | Web page | PDF ]
[DFKN19]
J. Danger, L. Fribourg, U. Kühne, and M. Naceur. LAOCOÖN: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection. In Proceedings of the 22nd Euromicro Conference on Digital System Design (DSD'19), pages 269--276, Kallithea, Greece, August 2019. IEEE Press.
doi: 10.1109/DSD.2019.00047.
[ BibTex | DOI | Web page ]
[GMS19]
P. Gastin, S. Mukherjee, and B. Srivathsan. Fast algorithms for handling diagonal constraints in timed automata. In Proceedings of the 31st International Conference on Computer Aided Verification (CAV'19), volume 11561 of Lecture Notes in Computer Science, pages 41--59, New York, USA, July 2019. Springer.
doi: 10.1007/978-3-030-25540-4_3.
[ BibTex | DOI | Web page | PDF ]
[BKM+19]
P. Bouyer, O. Kupferman, N. Markey, B. Maubert, A. Murano, and G. Perelli. Reasoning about Quality and Fuzziness of Strategic Behaviours. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI'19), pages 1588--1594. IJCAI organization, July 2019.
doi: 10.24963/ijcai.2019/220.
[ BibTex | DOI | Web page | PDF ]
[For19]
M. Fortin. FO = FO3 for linear orders with monotone binary relations. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP'19), volume 132 of Leibniz International Proceedings in Informatics, pages 116:1--116:13, Patras, Greece, July 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2019.116.
[ BibTex | DOI | Web page | PDF ]
[Gas19]
P. Gastin. Modular Descriptions of Regular Functions. In Proceedings of the 8th International Conference on Algebraic Informatics (CAI'19), volume 11545 of Lecture Notes in Computer Science, pages 3--9, Nis, Serbia, June 2019. Springer. Invited talk.
doi: 10.1007/978-3-030-21363-3_1.
[ BibTex | DOI | PDF ]
[AGJK19]
S. Akshay, P. Gastin, V. Jugé, and S. N. Krishna. Timed systems through the lens of logic. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785684.
[ BibTex | DOI | Web page | PDF ]
[CD19]
K. Chatterjee and L. Doyen. Graph Planning with Expected Finite Horizon. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785706.
[ BibTex | DOI ]
[ZSGF19]
D. Zonetti, A. Saoud, A. Girard, and L. Fribourg. A symbolic approach to voltage stability and power sharing in time-varyingDC microgrids. In Proceedings of the 18th European Control Conference (ECC'19), pages 903--909, Naples, Italy, June 2019. IEEE Press.
doi: 10.23919/ECC.2019.8796095.
[ BibTex | DOI | Web page ]
[ACF+19]
É. André, E. Coquard, L. Fribourg, J. Jerray, and D. Lesens. Parametric Schedulability Analysis of a Launcher Flight Control System Under Reactivity Constraints. In Proceedings of the 19th International Conference on Application of Concurrency to System Design (ACSD'19), pages 13--22, Aachen, Germany, June 2019. IEEE Computer Society Press.
doi: 10.1109/ACSD.2019.00006.
[ BibTex | DOI | Web page ]
[BBR19]
B. Bollig, P. Bouyer, and F. Reiter. Identifiers in Registers - Describing Network Algorithms with Logic. In Proceedings of the 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19), volume 11425 of Lecture Notes in Computer Science, pages 115--132, Prague, Czech Republic, April 2019. Springer.
doi: 10.1007/978-3-030-17127-8.
[ BibTex | DOI | Web page | PDF ]
[BQS19]
B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. Logical Methods in Computer Science, 15(3):32:1--32:26, 2019.
doi: 10.23638/LMCS-15(3:32)2019.
[ BibTex | DOI | Web page | PDF ]
[LPR18]
S. Le Roux, A. Pauly, and M. Randour. Extending finite-memory determinacy to Boolean combinations of winning conditions. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), volume 122 of Leibniz International Proceedings in Informatics, pages 38:1--38:20, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.38.
[ BibTex | DOI | Web page | PDF ]
[BJM18]
P. Bouyer, S. Jaziri, and N. Markey. Efficient Timed Diagnosis Using Automata with Timed Domains. In Proceedings of the 18th Workshop on Runtime Verification (RV'18), volume 11237 of Lecture Notes in Computer Science, pages 205--221, Limassol, Cyprus, November 2018. Springer.
doi: 10.1007/978-3-030-03769-7_12.
[ BibTex | DOI | Web page | PDF ]
[BLS18]
B. Bollig, M. Lehaut, and N. Sznajder. Round-Bounded Control of Parameterized Systems. In Proceedings of the 16th International Symposium on Automated Technology for Verification and Analysis (ATVA'18), volume 11138 of Lecture Notes in Computer Science, pages 370--386, Los Angeles, California, USA, October 2018. Springer.
doi: 10.1007/978-3-030-01090-4_22.
[ BibTex | DOI | Web page ]
[BBBC18]
N. Bertrand, P. Bouyer, T. Brihaye, and P. Carlier. When are Stochastic Transition Systems Tameable? Journal of Logic and Algebraic Methods in Programming, 99:41--96, October 2018.
doi: 10.1016/j.jlamp.2018.03.004.
[ BibTex | DOI | Web page | PDF ]
[BGMR18]
P. Bouyer, M. González, N. Markey, and M. Randour. Multi-weighted Markov Decision Processes with Reachability Objectives. In Proceedings of the 9th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'18), volume 277 of Electronic Proceedings in Theoretical Computer Science, pages 250--264, Saarbrücken, Germany, September 2018.
doi: 10.4204/EPTCS.277.18.
[ BibTex | DOI | Web page | PDF ]
[BBJ18]
B. Bérard, P. Bouyer, and V. Jugé. Finite bisimulations for dynamical systems with overlapping trajectories. In Proceedings of the 27th Annual EACSL Conference on Computer Science Logic (CSL'18), Leibniz International Proceedings in Informatics, Birmingham, UK, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2018.26.
[ BibTex | DOI | Web page | PDF ]
[GMS18]
P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability in timed automata with diagonal constraints. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 28:1--28:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.28.
[ BibTex | DOI | Web page | PDF ]
[BFG18]
B. Bollig, M. Fortin, and P. Gastin. It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ”Happened Before”. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 7:1--7:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.7.
[ BibTex | DOI | Web page | PDF ]
[BMR+18]
P. Bouyer, N. Markey, M. Randour, K. G. Larsen, and S. Laursen. Average-energy games. Acta Informatica, 55(2):91--127, July 2018.
doi: 10.1007/s00236-016-0274-1.
[ BibTex | DOI | Web page | PDF ]
[BBF+18a]
G. Bacci, P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and P.-A. Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. In Proceedings of the 22nd International Symposium on Formal Methods (FM'18), Lecture Notes in Computer Science, pages 203--221, Oxford, UK, July 2018. Springer. Best paper award.
doi: 10.1007/978-3-319-95582-7_12.
[ BibTex | DOI | Web page | PDF ]
[DGK18]
V. Dave, P. Gastin, and S. N. Krishna. Regular Transducer Expressions for Regular Transformations. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'18), pages 315--324, Oxford, UK, July 2018. ACM Press.
doi: 10.1145/3209108.3209182.
[ BibTex | DOI | Web page | PDF ]
[CGR18]
O. Carton, B. Guillon, and F. Reiter. Counter Machines and Distributed Automata. In Proceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA'18), volume 10875 of Lecture Notes in Computer Science, pages 13--28, Ghent, Belgium, June 2018. Springer.
doi: 10.1007/978-3-319-92675-9_2.
[ BibTex | DOI | PDF ]
[AGK18]
S. Akshay, P. Gastin, and S. N. Krishna. Analyzing Timed Systems Using Tree Automata. Logical Methods in Computer Science, 14(2):1--35, May 2018.
doi: 10.23638/LMCS-14(2:8)2018.
[ BibTex | DOI | Web page | PDF ]
[ABG18]
C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. Information and Computation, 259:305--327, April 2018.
doi: 10.1016/j.ic.2017.05.006.
[ BibTex | DOI | PDF ]
[Bou18]
P. Bouyer. Games on graphs with a public signal monitoring. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), volume 10803 of Lecture Notes in Computer Science, pages 530--547, Thessaloniki, Greece, April 2018. Springer.
doi: 10.1007/978-3-319-89366-2_29.
[ BibTex | DOI | Web page | PDF ]
[BBF+18b]
B. Barbot, M. Beccuti, G. Franceschinis, S. Haddad, and C. Picaronny. Bounds Computation for Symmetric Nets. Research Report hal-01726011, HAL-Inria, March 2018.
[ BibTex | Web page | PDF ]
[GBM18]
P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 34:1--34:15, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.34.
[ BibTex | DOI | Web page | PDF ]
[Bv18]
D. Berwanger and M. van den Bogaard. Consensus Game Acceptors and Iterated Transductions. International Journal of Foundations of Computer Science, 29(02):165--185, February 2018.
doi: 10.1142/S0129054118400026.
[ BibTex | DOI | Web page | PDF ]
[GM18]
P. Gastin and B. Monmege. A unifying survey on weighted logics and weighted automata. Soft Computing, 22(4):1047--1065, February 2018.
doi: 10.1007/s00500-015-1952-6.
[ BibTex | DOI | Web page | PDF ]
[BFL+18]
P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, J. Ouaknine, and J. Worrell. Model Checking Real-Time Systems. In Handbook of Model Checking, pages 1001--1046. Springer, 2018.
doi: 10.1007/978-3-319-10575-8_29.
[ BibTex | DOI | Web page | PDF ]
[BLMP18]
V. Brattka, S. Le Roux, J. S. Miller, and A. Pauly. Connected Choice and Brouwer's Fixed Point Theorem. Journal of Mathematical Logic, 2018. To appear.
[ BibTex ]
[Car17]
P. Carlier. Verification of Stochastic Timed Automata. Thèse de doctorat, Ecole Normale Supérieure de Cachan (ENS Paris-Saclay) and Université de Mons, December 2017.
[ BibTex | Web page | PDF ]
[Doy17]
L. Doyen. The Multiple Dimensions of Mean-Payoff Games. In Proceedings of the 11th Workshop on Reachability Problems in Computational Models (RP'17), volume 10506 of Lecture Notes in Computer Science, pages 1--8, London, UK, September 2017. Springer.
doi: 10.1007/978-3-319-67089-8_1.
[ BibTex | DOI | Web page | PDF ]
[GBB+17]
M. González, O. Beaude, P. Bouyer, S. Lasaulce, and N. Markey. Stratégies d'ordonnancement de consommation d'énergie en présence d'information imparfaite de prévision. In Actes du XXVIème colloque GRETSI, Juan-les-Pins, France, September 2017.
[ BibTex | Web page | PDF ]
[BHJ17]
P. Bouyer, S. Haddad, and V. Jugé. Unbounded product-form Petri nets. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 31:1--31:16, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.31.
[ BibTex | DOI | Web page | PDF ]
[AGKS17]
S. Akshay, P. Gastin, S. N. Krishna, and I. Sarkar. Towards an Efficient Tree Automata based technique for Timed Systems. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 39:1--39:15, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.39.
[ BibTex | DOI | Web page | PDF ]
[BQS17]
B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 33:1--33:16, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.33.
[ BibTex | DOI | Web page | PDF ]
[BJM17]
P. Bouyer, S. Jaziri, and N. Markey. On the Determinization of Timed Systems. In Proceedings of the 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'17), volume 10419 of Lecture Notes in Computer Science, pages 25--41, Berlin, Germany, September 2017. Springer.
doi: 10.1007/978-3-319-65765-3_2.
[ BibTex | DOI | Web page ]
[CDH17]
K. Chatterjee, L. Doyen, and Th. A. Henzinger. The Cost of Exactness in Quantitative Reachability. In Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, volume 10460 of Lecture Notes in Computer Science, pages 367--381. Springer, August 2017.
doi: 10.1007/978-3-319-63121-9_18.
[ BibTex | DOI | PDF ]
[BLM+17]
P. Bouyer, F. Laroussinie, N. Markey, J. Ouaknine, and J. Worrell. Timed temporal logics. In Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, volume 10460 of Lecture Notes in Computer Science, pages 211--230. Springer, August 2017.
doi: 10.1007/978-3-319-65764-6_11.
[ BibTex | DOI | Web page | PDF ]
[FMW17]
M. Fortin, A. Muscholl, and I. Walukiewicz. Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems. In Proceedings of the 29th International Conference on Computer Aided Verification (CAV'17), volume 10427 of Lecture Notes in Computer Science, pages 155--175, Heidelberg, Germany, July 2017. Springer.
doi: 10.1007/978-3-319-63390-9_9.
[ BibTex | DOI | Web page ]
[BR17]
D. Berwanger and R. Ramanujam. Deviator Detection under Imperfect Monitoring. In Proceedings of the 5th International Workshop on Strategic Reasoning (SR'17), Liverpool, UK, July 2017.
[ BibTex | Web page | PDF ]
[BFRR17]
V. Bruyère, E. Filiot, M. Randour, and J.-F. Raskin. Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. Information and Computation, 254(2):259--295, June 2017. To appear.
doi: 10.1016/j.ic.2016.10.011.
[ BibTex | DOI ]
[BMV17b]
P. Bouyer, N. Markey, and S. Vester. Nash Equilibria in Symmetric Graph Games with Partial Observation. Information and Computation, 254(2):238--258, June 2017.
doi: 10.1016/j.ic.2016.10.010.
[ BibTex | DOI | Web page | PDF ]
[Gar17]
P. Gardy. Semantics of Strategy Logic. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2017.
[ BibTex | Web page | PDF ]
[BM17]
D. Berwanger and A. B. Mathew. Infinite games with finite knowledge gaps. Information and Computation, 254:217--237, June 2017.
doi: 10.1016/j.ic.2016.10.009.
[ BibTex | DOI | Web page | PDF ]
[BMv17a]
D. Berwanger, A. B. Mathew, and M. van den Bogaard. Hierarchical information and the synthesis of distributed strategies. Acta Informatica, June 2017.
doi: 10.1007/s00236-017-0306-5.
[ BibTex | DOI | Web page | PDF ]
[BJ17]
P. Bouyer and V. Jugé. Dynamic Complexity of the Dyck Reachability. In Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Lecture Notes in Computer Science, pages 265--280, Uppsala, Sweden, April 2017. Springer.
doi: 10.1007/978-3-662-54458-7_16.
[ BibTex | DOI | Web page | PDF ]
[BHM+17]
P. Bouyer, P. Hofman, N. Markey, M. Randour, and M. Zimmermann. Bounding Average-energy Games. In Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Lecture Notes in Computer Science, pages 179--195, Uppsala, Sweden, April 2017. Springer.
doi: 10.1007/978-3-662-54458-7_11.
[ BibTex | DOI | Web page | PDF ]
[Sta17]
D. Stan. Randomized Strategies in Concurrent Games. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2017.
[ BibTex | Web page | PDF ]
[Jug17]
V. Jugé. The Relaxation Normal Form of Braids is Regular. International Journal of Algebra and Computation, 27(1):61--106, February 2017.
doi: 10.1142/S0218196717500059.
[ BibTex | DOI | Web page ]
[BMJ17]
P. Bouyer, N. Markey, and V. Jugé. Courcelle's Theorem Made Dynamic. Research Report 1702.05183, Computing Research Repository, February 2017. 14 pages.
[ BibTex | Web page | PDF ]
[BMPS17]
P. Bouyer, N. Markey, N. Perrin, and P. Schlehuber-Caissier. Timed automata abstraction of switched dynamical systems using control funnels. Real-Time Systems, 53(3):327--353, 2017.
doi: 10.1007/s11241-016-9262-3.
[ BibTex | DOI | Web page | PDF ]
[CDFR17]
K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin. Doomsday equilibria for omega-regular games. Information and Computation, 254:296--315, 2017.
doi: 10.1016/j.ic.2016.10.012.
[ BibTex | DOI | PDF ]
[ABH17]
M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of ordered multi-pushdown automata is 2ETIME-complete. International Journal of Foundations of Computer Science, 28(8):945--975, 2017.
doi: 10.1142/S0129054117500332.
[ BibTex | DOI | Web page | PDF ]
[Van16]
M. Van den Bogaard. Motifs de Flot d'Information dans les Jeux à Information Imparfaite. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2016.
[ BibTex | Web page | PDF ]
[Moh16]
S. Mohamed. Une méthode topologique pour la recherche d'ensembles invariants de systèmes continus et à commutation. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2016.
[ BibTex | Web page | PDF ]
[BMJ16]
P. Bouyer, N. Markey, and V. Jugé. Dynamic Complexity of Parity Games with Bounded Tree-Width. Research Report 1610.00571, Computing Research Repository, October 2016. 33 pages.
[ BibTex | Web page | PDF ]
[BMS16]
P. Bouyer, N. Markey, and D. Stan. Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. In Proceedings of the 7th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'16), volume 226 of Electronic Proceedings in Theoretical Computer Science, pages 61--75, Catania, Italy, September 2016.
doi: 10.4204/EPTCS.226.5.
[ BibTex | DOI | Web page | PDF ]
[LFS16]
A. Le Coënt, L. Fribourg, and R. Soulat. Compositional analysis of Boolean networks using local fixed-point iterations. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 134--147, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_10.
[ BibTex | DOI | Web page | PDF ]
[LFM+16]
A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and L. Chamoin. Distributed Synthesis of State-Dependent Switching Control. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 119--133, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_9.
[ BibTex | DOI | Web page | PDF ]
[FM16]
M. Fränzle and N. Markey, editors. Proceedings of the 14th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'16), volume 9884 of Lecture Notes in Computer Science, Québec City, Canada, August 2016. Springer.
doi: 10.1007/978-3-319-44878-7.
[ BibTex | DOI | Web page ]
[Bou16]
P. Bouyer. Optimal Reachability in Weighted Timed Automata and Games. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), volume 58 of Leibniz International Proceedings in Informatics, pages 3:1--3:3, Krakow, Poland, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2016.3.
[ BibTex | DOI | Web page | PDF ]
[ABK+16]
S. Akshay, P. Bouyer, S. N. Krishna, L. Manasa, and A. Trivedi. Stochastic Timed Games Revisited. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), volume 58 of Leibniz International Proceedings in Informatics, pages 8:1--8:14, Krakow, Poland, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2016.8.
[ BibTex | DOI | Web page | PDF ]
[NPR16]
R. Niskanen, I. Potapov, and J. Reichert. Undecidability of Two-dimensional Robot Games. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), volume 58 of Leibniz International Proceedings in Informatics, pages 73:1--73:13, Krakow, Poland, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2016.73.
[ BibTex | DOI | Web page | PDF ]
[DLM16]
A. David, F. Laroussinie, and N. Markey. On the expressiveness of QCTL. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 28:1--28:15, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.28.
[ BibTex | DOI | Web page | PDF ]
[BDJ+16]
Th. Brihaye, B. Delahaye, L. Jezequel, N. Markey, and J. Srba, editors. Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) and of the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16), volume 220 of Electronic Proceedings in Theoretical Computer Science, Eindhoven, The Netherlands, July 2016.
doi: 10.4204/EPTCS.220.
[ BibTex | DOI | Web page ]
[BBBC16]
N. Bertrand, P. Bouyer, Th. Brihaye, and P. Carlier. Analysing Decisive Stochastic Processes. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 101:1--101:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.101.
[ BibTex | DOI | Web page | PDF ]
[CD16a]
K. Chatterjee and L. Doyen. Computation Tree Logic for Synchronization Properties. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 98:1--98:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.98.
[ BibTex | DOI | Web page | PDF ]
[BCM16]
P. Bouyer, M. Colange, and N. Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In Proceedings of the 28th International Conference on Computer Aided Verification (CAV'16) -- Part I, volume 9779 of Lecture Notes in Computer Science, pages 513--530, Toronto, Canada, July 2016. Springer.
doi: 10.1007/978-3-319-41528-4_28.
[ BibTex | DOI | Web page ]
[BMR+16]
P. Bouyer, N. Markey, M. Randour, A. Sangnier, and D. Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 106:1--106:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.106.
[ BibTex | DOI | Web page ]
[CD16b]
K. Chatterjee and L. Doyen. Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 247--256, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2934513.
[ BibTex | DOI | Web page ]
[BBCM16]
P. Bouyer, Th. Brihaye, P. Carlier, and Q. Menet. Compositional Design of Stochastic Timed Automata. In Proceedings of the 11th International Computer Science Symposium in Russia (CSR'16), volume 9691 of Lecture Notes in Computer Science, pages 117--130, St Petersburg, Russia, June 2016. Springer.
doi: 10.1007/978-3-319-34171-2_9.
[ BibTex | DOI | Web page | PDF ]
[LBB+16]
A. Linard, B. Barbot, D. Buchs, M. Colange, C. Démoulins, L. Hillah, and A. Martin. Layered Data: A Modular Formal Definition without Formalisms. In Proceedings of the 10th International Workshop on Petri Nets and Software Engineering (PNSE'16), volume 1591 of CEUR Workshop Proceedings, pages 287--306, Torun, Poland, June 2016. CEUR-WS.org.
[ BibTex | Web page | PDF ]
[LACF16]
A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, and L. Fribourg. Control of Nonlinear Switched Systems Based on Validated Simulation. In Proceedings of the 2nd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR'16), pages 1--6, Vienna, Austria, April 2016. IEEE Computer Society Press.
[ BibTex | Web page | PDF ]
[FGMP16]
L. Fribourg, É. Goubault, S. Mohamed, and S. Putot. A Topological Method for Finding Invariant Sets of Switched Systems. In Proceedings of the 19th ACM International Conference on Hybrid Systems: Computation and Control (HSCC'16), pages 61--70, Vienna, Austria, April 2016. ACM Press.
doi: 10.1145/2883817.2883822.
[ BibTex | DOI | Web page | PDF ]
[BGM16]
P. Bouyer, P. Gardy, and N. Markey. On the semantics of Strategy Logic. Information Processing Letters, 116(2):75--79, February 2016.
doi: 10.1016/j.ipl.2015.10.004.
[ BibTex | DOI | Web page | PDF ]
[LDR+16]
A. Le Coënt, F. De Vuyst, C. Rey, L. Chamoin, and L. Fribourg. Control of mechanical systems using set-based methods. International Journal of Dynamics and Control, pages 1--17, 2016.
doi: 10.1007/s40435-016-0245-y.
[ BibTex | DOI | Web page | PDF ]
[CDGH15]
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger. Randomness for free. Information and Computation, 245:3--16, December 2015.
doi: 10.1016/j.ic.2015.06.003.
[ BibTex | DOI | Web page | PDF ]
[LM15]
F. Laroussinie and N. Markey. Augmenting ATL with strategy contexts. Information and Computation, 245:98--123, December 2015.
doi: 10.1016/j.ic.2014.12.020.
[ BibTex | DOI | Web page | PDF ]
[BV15b]
D. Berwanger and M. Van den Bogaard. Games with Delays. A Frankenstein Approach. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 307--319, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.307.
[ BibTex | DOI | Web page | PDF ]
[BGM15]
P. Bouyer, P. Gardy, and N. Markey. Weighted strategy logic with boolean goals over one-counter games. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 69--83, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.69.
[ BibTex | DOI | Web page | PDF ]
[Gon15]
M. González. Constructions d'Information Parfaite pour certains Jeux à Information Imparfaite. Quelques Algorithmes. Rapport de Master, Université Pierre et Marie Curie, Paris, France, December 2015.
[ BibTex ]
[BMV15]
D. Berwanger, A. B. Mathew, and M. Van den Bogaard. Hierarchical Information Patterns and Distributed Strategy Synthesis. In Proceedings of the 13th International Symposium on Automated Technology for Verification and Analysis (ATVA'15), volume 9364 of Lecture Notes in Computer Science, pages 378--393, Shanghai, China, October 2015. Springer.
doi: 10.1007/978-3-319-24953-7_28.
[ BibTex | DOI | Web page | PDF ]
[MDB15]
N. Markey, L. Doyen, and D. Berwanger. Models for large-scale systems. Cassting deliverable D1.3 (FP7-ICT-601148), September 2015. 17 pages.
[ BibTex | Web page | PDF ]
[FGM+15]
L. Fribourg, É. Goubault, S. Mohamed, M. Mrozek, and S. Putot. A Topological Method for Finding Invariants of Continuous Systems. In Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15), volume 9328 of Lecture Notes in Computer Science, pages 63--75, Warsaw, Poland, September 2015. Springer.
doi: 10.1007/978-3-319-24537-9_7.
[ BibTex | DOI | Web page | PDF ]
[BFM15]
P. Bouyer, E. Fang, and N. Markey. Permissive strategies in timed automata and games. In Proceedings of the 15th International Workshop on Automated Verification of Critical Systems (AVoCS'15), volume 72 of Electronic Communications of the EASST, Edinburgh, UK, September 2015. European Association of Software Science and Technology.
doi: 10.14279/tuj.eceasst.72.1015.
[ BibTex | DOI | Web page | PDF ]
[BMR+15]
P. Bouyer, N. Markey, M. Randour, K. G. Larsen, and S. Laursen. Average-energy games. In Proceedings of the 6th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'15), volume 193 of Electronic Proceedings in Theoretical Computer Science, pages 1--15, Genova, Italy, September 2015.
doi: 10.4204/EPTCS.193.1.
[ BibTex | DOI | Web page | PDF ]
[LMS15]
F. Laroussinie, N. Markey, and A. Sangnier. ATL_sc with partial observation. In Proceedings of the 6th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'15), volume 193 of Electronic Proceedings in Theoretical Computer Science, pages 43--57, Genova, Italy, September 2015.
doi: 10.4204/EPTCS.193.4.
[ BibTex | DOI | Web page | PDF ]
[BMPS15]
P. Bouyer, N. Markey, N. Perrin, and P. Schlehuber. Timed automata abstraction of switched dynamical systems using control funnels. In Proceedings of the 13th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'15), volume 9268 of Lecture Notes in Computer Science, pages 60--75, Madrid, Spain, September 2015. Springer.
doi: 10.1007/978-3-319-22975-1_5.
[ BibTex | DOI | Web page | PDF ]
[AM15]
É. André and N. Markey. Language Preservation Problems in Parametric Timed Automata. In Proceedings of the 13th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'15), volume 9268 of Lecture Notes in Computer Science, pages 27--43, Madrid, Spain, September 2015. Springer.
doi: 10.1007/978-3-319-22975-1_3.
[ BibTex | DOI | Web page | PDF ]
[BJM15]
P. Bouyer, S. Jaziri, and N. Markey. On the Value Problem in Weighted Timed Games. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics, pages 311--324, Madrid, Spain, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2015.311.
[ BibTex | DOI | Web page | PDF ]
[For15]
M. Fortin. Verification of distributed systems with parameterized network topology. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2015.
[ BibTex ]
[Bou15]
P. Bouyer. On the optimal reachability problem in weighted timed automata and games. In Proceedings of the 7th Workshop on Non-Classical Models of Automata and Applications (NCMA'15), volume 318 of books@ocg.at, pages 11--36, Porto, Portugal, August 2015. Austrian Computer Society.
[ BibTex | Web page | PDF ]
[Rei15]
J. Reichert. Décidabilité et complexité de jeux d'accessibilité sur des systèmes à compteurs. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2015.
[ BibTex | Web page | PDF ]
[BV15a]
D. Berwanger and M. Van den Bogaard. Consensus Game Acceptors. In Proceedings of the 19th International Conference on Developments in Language Theory (DLT'15), volume 9168 of Lecture Notes in Computer Science, pages 108--119, Liverpool, UK, July 2015. Springer.
doi: 10.1007/978-3-319-21500-6_8.
[ BibTex | DOI | Web page | PDF ]
[CDV15]
K. Chatterjee, L. Doyen, and M. Vardi. The Complexity of Synthesis from Probabilistic Components. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, pages 108--120, Kyoto, Japan, July 2015. Springer.
doi: 10.1007/978-3-662-47666-6_9.
[ BibTex | DOI | Web page | PDF ]
[RRS15a]
M. Randour, J.-F. Raskin, and O. Sankur. Percentile Queries in Multi-Dimensional Markov Decision Processes. In Proceedings of the 27th International Conference on Computer Aided Verification (CAV'15) -- Part I, volume 9206 of Lecture Notes in Computer Science, pages 123--139, San Francisco, CA, USA, July 2015. Springer.
doi: 10.1007/978-3-319-21690-4_8.
[ BibTex | DOI | Web page | PDF ]
[BBMU15]
P. Bouyer, R. Brenguier, N. Markey, and M. Ummels. Pure Nash Equilibria in Concurrent Games. Logical Methods in Computer Science, 11(2:9), June 2015.
doi: 10.2168/LMCS-11(2:9)2015.
[ BibTex | DOI | Web page | PDF ]
[CLMT15]
K. Chatterjee, S. Lafortune, N. Markey, and W. Thomas. Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). Dagstuhl Reports, 5(2):1--25, June 2015.
doi: 10.4230/DagRep.5.2.1.
[ BibTex | DOI | Web page | PDF ]
[CDRR15]
K. Chatterjee, L. Doyen, M. Randour, and J.-F. Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. Information and Computation, 242:25--52, June 2015.
doi: 10.1016/j.ic.2015.03.010.
[ BibTex | DOI | Web page | PDF ]
[MD15]
N. Markey and A. Delaborde. Annual report for Year 2. Cassting deliverable D6.3 (FP7-ICT-601148), May 2015. 34 pages.
[ BibTex ]
[FKM15]
L. Fribourg, U. Kühne, and N. Markey. Game-based Synthesis of Distributed Controllers for Sampled Switched Systems. In Proceedings of the 2nd International Workshop on Synthesis of Continuous Parameters (SYNCOP'15), volume 44 of Open Access Series in Informatics, pages 47--61, London, UK, April 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.SynCoP.2015.47.
[ BibTex | DOI | Web page | PDF ]
[LDR+15]
A. Le Coënt, F. De Vuyst, Ch. Rey, L. Chamoin, and L. Fribourg. Guaranteed control of switched control systems using model order reduction and state-space bisection. In Proceedings of the 2nd International Workshop on Synthesis of Continuous Parameters (SYNCOP'15), volume 44 of Open Access Series in Informatics, pages 32--46, London, UK, April 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.SynCoP.2015.32.
[ BibTex | DOI | Web page | PDF ]
[VCD+15]
Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. M. Rabinovich, and J.-F. Raskin. The complexity of multi-mean-payoff and multi-energy games. Information and Computation, 241:177--196, April 2015.
doi: 10.1016/j.ic.2015.03.001.
[ BibTex | DOI | Web page | PDF ]
[GDML15]
G. Geeraerts, S. Dehouck, N. Markey, and K. G. Larsen. Efficient algorithms for multi-player games with quantitative aspects. Cassting deliverable D2.1 (FP7-ICT-601148), March 2015. 22 pages.
[ BibTex | Web page | PDF ]
[BMS15]
P. Bouyer, N. Markey, and O. Sankur. Robust Reachability in Timed Automata and Games: A Game-based Approach. Theoretical Computer Science, 563:43--74, January 2015.
doi: 10.1016/j.tcs.2014.08.014.
[ BibTex | DOI | Web page | PDF ]
[RRS15b]
M. Randour, J.-F. Raskin, and O. Sankur. Variations on the Stochastic Shortest Path Problem. In Proceedings of the 16th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'15), volume 8931 of Lecture Notes in Computer Science, pages 1--18, Mumbai, India, January 2015. Springer.
doi: 10.1007/978-3-662-46081-8_1.
[ BibTex | DOI | Web page | PDF ]
[DJL+14]
L. Doyen, L. Juhl, K. G. Larsen, N. Markey, and M. Shirmohammadi. Synchronizing words for weighted and timed automata. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 121--132, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.121.
[ BibTex | DOI | Web page | PDF ]
[BMS14]
P. Bouyer, N. Markey, and D. Stan. Mixed Nash Equilibria in Concurrent Games. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 351--363, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.351.
[ BibTex | DOI | Web page | PDF ]
[BBB+14]
N. Bertrand, P. Bouyer, Th. Brihaye, Q. Menet, C. Baier, M. Größer, and M. Jurdziński. Stochastic Timed Automata. Logical Methods in Computer Science, 10(4:6), December 2014.
doi: 10.2168/LMCS-10(4:6)2014.
[ BibTex | DOI | Web page | PDF ]
[FKS14]
L. Fribourg, U. Kühne, and R. Soulat. Finite Controlled Invariants for Sampled Switched Systems. Formal Methods in System Design, 45(3):303--329, December 2014.
doi: 10.1007/s10703-014-0211-2.
[ BibTex | DOI | Web page | PDF ]
[LM14]
F. Laroussinie and N. Markey. Quantified CTL: Expressiveness and Complexity. Logical Methods in Computer Science, 10(4:17), December 2014.
doi: 10.2168/LMCS-10(4:17)2014.
[ BibTex | DOI | Web page | PDF ]
[Shi14]
M. Shirmohammadi. Qualitative Analysis of Synchronizing Probabilistic Systems. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France and Université Libre de Bruxelles, Belgium, December 2014.
[ BibTex | Web page | PDF ]
[BGM14]
P. Bouyer, P. Gardy, and N. Markey. Quantitative verification of weighted Kripke structures. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), volume 8837 of Lecture Notes in Computer Science, pages 64--80, Sydney, Australia, November 2014. Springer.
doi: 10.1007/978-3-319-11936-6_6.
[ BibTex | DOI | Web page | PDF ]
[MV14]
N. Markey and S. Vester. Symmetry Reduction in Infinite Games with Finite Branching. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), volume 8837 of Lecture Notes in Computer Science, pages 281--296, Sydney, Australia, November 2014. Springer.
doi: 10.1007/978-3-319-11936-6_21.
[ BibTex | DOI | Web page | PDF ]
[MCGS14]
N. Markey, N. Chaturvedi, G. Geeraerts, and J. Srba. Efficient strategy synthesis for complex objectives. Cassting deliverable D2.4 (FP7-ICT-601148), October 2014. 20 pages.
[ BibTex | Web page | PDF ]
[AFG14]
S. Abiteboul, L. Fribourg, and J. Goubault-Larrecq. Gérard Berry : un informaticien médaille d'or du CNRS 2014. 1024 -- Bulletin de la société informatique de France, 4:139--142, October 2014.
[ BibTex | Web page | PDF ]
[DMS14]
L. Doyen, Th. Massart, and M. Shirmohammadi. Robust Synchronization in Markov Decision Processes. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 234--248, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_17.
[ BibTex | DOI | Web page | PDF ]
[BMM14]
P. Bouyer, N. Markey, and R. M. Matteplackel. Averaging in LTL. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 266--280, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_19.
[ BibTex | DOI | Web page | PDF ]
[Jaz14]
S. Jaziri. Robustness issues in priced timed automata. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2014.
[ BibTex ]
[JLMX14]
S. Jaziri, K. G. Larsen, R. Mardare, and B. Xue. Adequacy and Complete Axiomatization for Timed Modal Logic. In Proceedings of the 30th Conference on Mathematical Foundations of Programming Semantics (MFPS'14), volume 308 of Electronic Notes in Theoretical Computer Science, pages 183--210, Ithaca, New York, USA, June 2014. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2014.10.011.
[ BibTex | DOI | Web page | PDF ]
[FFL+14]
G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Correct-by-design Control Synthesis for Multilevel Converters using State Space Decomposition. In Proceedings of the 2nd French-Singaporean Workshop on Formal Methods and Applications (FSFMA'14), volume 156 of Electronic Proceedings in Theoretical Computer Science, pages 5--16, Singapore, May 2014.
doi: 10.4204/EPTCS.156.5.
[ BibTex | DOI | Web page | PDF ]
[SLAF14]
Y. Sun, G. Lipari, É. André, and L. Fribourg. Toward Parametric Timed Interfaces for Real-Time Components. In Proceedings of the 1st International Workshop on Synthesis of Continuous Parameters (SYNCOP'14), volume 145 of Electronic Proceedings in Theoretical Computer Science, pages 49--64, Grenoble, France, April 2014.
doi: 10.4204/EPTCS.145.6.
[ BibTex | DOI | Web page | PDF ]
[Fan13]
E. Fang. Permissive multi-strategies in timed games. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2013.
[ BibTex ]

This file was generated by bibtex2html 1.98.

About LSV