Publications : Patricia BOUYER

[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 ]

[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 ]

[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 ]

[GBM20]

P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. Theory of Computing Systems, 64(3), 2020.
[ BibTex | Web page | PDF ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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⁺18]

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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[BMV17]

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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[BMV14]

P. Bouyer, N. Markey, and S. Vester. Nash Equilibria in Symmetric Games with Partial Observation. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR'14), volume 146 of Electronic Proceedings in Theoretical Computer Science, pages 49--55, Grenoble, France, April 2014.
doi: 10.4204/EPTCS.146.7.
[ BibTex | DOI | Web page | PDF ]

[BLM14]

P. Bouyer, K. G. Larsen, and N. Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. Performance Evaluation, 73:91--109, March 2014.
doi: 10.1016/j.peva.2013.11.002.
[ BibTex | DOI | Web page | PDF ]

[SBM14]

O. Sankur, P. Bouyer, and N. Markey. Shrinking Timed Automata. Information and Computation, 234:107--132, February 2014.
doi: 10.1016/j.ic.2014.01.002.
[ BibTex | DOI | Web page | PDF ]

[BMS13b]

P. Bouyer, N. Markey, and O. Sankur. Robustness in timed automata. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 1--18, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_1.
[ BibTex | DOI | Web page | PDF ]

[BMS13a]

P. Bouyer, N. Markey, and O. Sankur. Robust Weighted Timed Automata and Games. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, pages 31--46, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40229-6_3.
[ BibTex | DOI | Web page | PDF ]

[SBMR13]

O. Sankur, P. Bouyer, N. Markey, and P.-A. Reynier. Robust Controller Synthesis in Timed Automata. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 546--560, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_38.
[ BibTex | DOI | Web page | PDF ]

[BBL⁺13]

B. Bérard, P. Bouyer, K. G. Larsen, N. Markey, J. Mullins, O. Sankur, M. Sassolas, and C. Thrane. Measuring the robustness. Deliverable ImpRo 3.1, (ANR-10-BLAN-0317), January 2013. 59 pages.
[ BibTex | Web page | PDF ]

[BFH⁺13]

P. Bouyer, S. Faucou, S. Haar, A. Jovanivić, D. Lime, N. Markey, O. H. Roux, and O. Sankur. Control tasks for Timed System; Robustness issues. Deliverable ImpRo 5.1, (ANR-10-BLAN-0317), January 2013. 34 pages.
[ BibTex | Web page | PDF ]

[BBJM12]

P. Bouyer, Th. Brihaye, M. Jurdziński, and Q. Menet. Almost-Sure Model-Checking of Reactive Timed Automata. In Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST'12), pages 138--147, London, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/QEST.2012.10.
[ BibTex | DOI | Web page | PDF ]

[BLM12]

P. Bouyer, K. G. Larsen, and N. Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. In Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST'12), pages 128--137, London, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/QEST.2012.28.
[ BibTex | DOI | Web page | PDF ]

[BMO⁺12]

P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On Termination and Invariance for Faulty Channel Systems. Formal Aspects of Computing, 24(4-6):595--607, July 2012.
doi: 10.1007/s00165-012-0234-7.
[ BibTex | DOI | Web page | PDF ]

[BMS12]

P. Bouyer, N. Markey, and O. Sankur. Robust Reachability in Timed Automata: A Game-based Approach. In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP'12) -- Part II, volume 7392 of Lecture Notes in Computer Science, pages 128--140, Warwick, UK, July 2012. Springer.
doi: 10.1007/978-3-642-31585-5_15.
[ BibTex | DOI | Web page | PDF ]

[BBMU12]

P. Bouyer, R. Brenguier, N. Markey, and M. Ummels. Concurrent games with ordered objectives. In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), volume 7213 of Lecture Notes in Computer Science, pages 301--315, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_20.
[ BibTex | DOI | Web page | PDF ]

[ABB⁺12]

S. Akshay, B. Bérard, P. Bouyer, S. Haar, S. Haddad, C. Jard, D. Lime, N. Markey, P.-A. Reynier, O. Sankur, and Y. Thierry-Mieg. Overview of Robustness in Timed Systems. Deliverable ImpRo D 2.1 (ANR-2010-BLAN-0317), January 2012.
[ BibTex | Web page | PDF ]

[SBM11]

O. Sankur, P. Bouyer, and N. Markey. Shrinking Timed Automata. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 90--102, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.90.
[ BibTex | DOI | Web page | PDF ]

[BBMU11]

P. Bouyer, R. Brenguier, N. Markey, and M. Ummels. Nash Equilibria in Concurrent Games with Büchi Objectives. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 375--386, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.375.
[ BibTex | DOI | Web page | PDF ]

[BMOU11]

P. Bouyer, N. Markey, J. Olschewski, and M. Ummels. Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. In Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis (ATVA'11), volume 6996 of Lecture Notes in Computer Science, pages 135--149, Taipei, Taiwan, October 2011. Springer.
doi: 10.1007/978-3-642-24372-1_11.
[ BibTex | DOI | Web page | PDF ]

[BMS11]

P. Bouyer, N. Markey, and O. Sankur. Robust Model-Checking of Timed Automata via Pumping in Channel Machines. In Proceedings of the 9th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'11), volume 6919 of Lecture Notes in Computer Science, pages 97--112, Aalborg, Denmark, September 2011. Springer.
doi: 10.1007/978-3-642-24310-3_8.
[ BibTex | DOI | Web page | PDF ]

[BLM⁺11]

P. Bouyer, K. G. Larsen, N. Markey, O. Sankur, and C. Thrane. Timed automata can always be made implementable. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 76--91, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_6.
[ BibTex | DOI | Web page | PDF ]

[BFLM11]

P. Bouyer, U. Fahrenberg, K. G. Larsen, and N. Markey. Quantitative analysis of real-time systems using priced timed automata. Communications of the ACM, 54(9):78--87, September 2011.
doi: 10.1145/1995376.1995396.
[ BibTex | DOI | Web page | PDF ]

[BBBS11]

N. Bertrand, P. Bouyer, Th. Brihaye, and A. Stainer. Emptiness and Universality Problems in Timed Automata with Positive Frequency. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 246--257, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_19.
[ BibTex | DOI | Web page | PDF ]

[BCL11]

P. Bouyer, F. Cassez, and F. Laroussinie. Timed Modal Logics for Real-Time Systems: Specification, Verification and Control. Journal of Logic, Language and Information, 20(2):169--203, April 2011.
doi: 10.1007/s10849-010-9127-4.
[ BibTex | DOI | Web page | PDF ]

[HBM⁺10]

P. Hunter, P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. Computing rational radical sums in uniform TC^0. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 308--316, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.308.
[ BibTex | DOI | Web page | PDF ]

[BBM10a]

P. Bouyer, R. Brenguier, and N. Markey. Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. In Proceedings of the 8th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'10), volume 6246 of Lecture Notes in Computer Science, pages 62--76, Vienna, Austria, September 2010. Springer.
doi: 10.1007/978-3-642-15297-9_7.
[ BibTex | DOI | Web page | PDF ]

[BBM10b]

P. Bouyer, R. Brenguier, and N. Markey. Nash Equilibria for Reachability Objectives in Multi-player Timed Games. In Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in Computer Science, pages 192--206, Paris, France, August-September 2010. Springer.
doi: 10.1007/978-3-642-15375-4_14.
[ BibTex | DOI | Web page | PDF ]

[BFLM10]

P. Bouyer, U. Fahrenberg, K. G. Larsen, and N. Markey. Timed Automata with Observers under Energy Constraints. In Proceedings of the 13th International Conference on Hybrid Systems: Computation and Control (HSCC'10), pages 61--70, Stockholm, Sweden, April 2010. ACM Press.
doi: 10.1145/1755952.1755963.
[ BibTex | DOI | Web page | PDF ]

[BCM10]

P. Bouyer, F. Chevalier, and N. Markey. On the Expressiveness of TPTL and MTL. Information and Computation, 208(2):97--116, February 2010.
doi: 10.1016/j.ic.2009.10.004.
[ BibTex | DOI | Web page | PDF ]

[BBC10]

P. Bouyer, Th. Brihaye, and F. Chevalier. O-Minimal Hybrid Reachability Games. Logical Methods in Computer Science, 6(1:1), January 2010.
doi: 10.2168/LMCS-6(1:1)2010.
[ BibTex | DOI | Web page | PDF ]

[BBC09]

P. Bouyer, Th. Brihaye, and F. Chevalier. Weighted O-Minimal Hybrid Systems. Annals of Pure and Applied Logics, 161(3):268--288, December 2009.
doi: 10.1016/j.apal.2009.07.014.
[ BibTex | DOI | Web page | PDF ]

[BDMR09]

P. Bouyer, M. Duflot, N. Markey, and G. Renault. Measuring Permissivity in Finite Games. In Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09), volume 5710 of Lecture Notes in Computer Science, pages 196--210, Bologna, Italy, September 2009. Springer.
doi: 10.1007/978-3-642-04081-8_14.
[ BibTex | DOI | Web page | PDF ]

[BF09]

P. Bouyer and V. Forejt. Reachability in Stochastic Timed Games. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5556 of Lecture Notes in Computer Science, pages 103--114, Rhodes, Greece, July 2009. Springer.
doi: 10.1007/978-3-642-02930-1_9.
[ BibTex | DOI | Web page | PDF ]

[Bou09b]

P. Bouyer. Model-Checking Timed Temporal Logics. In Proceedings of the 4th Workshop on Methods for Modalities (M4M-5), volume 231 of Electronic Notes in Theoretical Computer Science, pages 323--341, Cachan, France, March 2009. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2009.02.044.
[ BibTex | DOI | Web page | PDF ]

[BLLM09]

P. Bouyer, F. Laroussinie, D. Lime, and N. Markey. Synthesis of timed controllers. Deliverable DOTS 1.2a (ANR-06-SETI-003), March 2009.
[ BibTex ]

[BHR09]

P. Bouyer, S. Haddad, and P.-A. Reynier. Undecidability Results for Timed Automata with Silent Transitions. Fundamenta Informaticae, 92(1-2):1--25, 2009.
[ BibTex | Web page | PS | PDF ]

[BKL⁺09]

P. Bouyer, J.-P. Katoen, R. Langerak, F. Laroussinie, N. Markey, and J.-F. Raskin. Transfer of correctness from models to implementation. Deliverable QUASIMODO 3.1 (ICT-FP7-STREP-214755), January 2009.
[ BibTex ]

[Bou09a]

P. Bouyer. From Qualitative to Quantitative Analysis of Timed Systems. Mémoire d'habilitation, Université Paris 7, Paris, France, January 2009.
[ BibTex | Web page | PDF ]

[BP09]

P. Bouyer and A. Petit. On extensions of timed automata. In Perspectives in Concurrency Theory, IARCS-Universities, pages 35--63. Universities Press, January 2009.
[ BibTex ]

[BBC⁺08]

B. Bollig, P. Bouyer, F. Cassez, Th. Chatain, P. Gastin, S. Haddad, and C. Jard. Model for distributed timed systems. Deliverable DOTS 3.1 (ANR-06-SETI-003), September 2008.
[ BibTex ]

[BBJ⁺08]

P. Bouyer, Th. Brihaye, M. Jurdziński, R. Lazić, and M. Rutkowski. Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. In Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), volume 5215 of Lecture Notes in Computer Science, pages 63--77, Saint-Malo, France, September 2008. Springer.
doi: 10.1007/978-3-540-85778-5_6.
[ BibTex | DOI | Web page | PDF ]

[BFL⁺08]

P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite Runs in Weighted Timed Automata with Energy Constraints. In Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), volume 5215 of Lecture Notes in Computer Science, pages 33--47, Saint-Malo, France, September 2008. Springer.
doi: 10.1007/978-3-540-85778-5_4.
[ BibTex | DOI | Web page | PDF ]

[BBBM08]

N. Bertrand, P. Bouyer, Th. Brihaye, and N. Markey. Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. In Proceedings of the 5th International Conference on Quantitative Evaluation of Systems (QEST'08), pages 55--64, Saint Malo, France, September 2008. IEEE Computer Society Press.
doi: 10.1109/QEST.2008.19.
[ BibTex | DOI | Web page | PDF ]

[Bou08b]

P. Bouyer. Probabilities in Timed Automata. Invited talk, Workshop Automata and Verification (AV'08), Mons, Belgium, August 2008.
[ BibTex ]

[BMOW08]

P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. On Expressiveness and Complexity in Real-time Model Checking. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP'08) -- Part II, volume 5126 of Lecture Notes in Computer Science, pages 124--135, Reykjavik, Iceland, July 2008. Springer.
doi: 10.1007/978-3-540-70583-3_11.
[ BibTex | DOI | Web page | PDF ]

[BLM08]

P. Bouyer, K. G. Larsen, and N. Markey. Model Checking One-clock Priced Timed Automata. Logical Methods in Computer Science, 4(2:9), June 2008.
doi: 10.2168/LMCS-4(2:9)2008.
[ BibTex | DOI | Web page | PDF ]

[BMR08]

P. Bouyer, N. Markey, and P.-A. Reynier. Robust Analysis of Timed Automata via Channel Machines. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 157--171, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_12.
[ BibTex | DOI | Web page | PS | PDF ]

[Bou08a]

P. Bouyer. Model-Checking Timed Temporal Logics. In Proceedings of the 4th Taiwanese-French Conference on Information Technology (TFIT'08), pages 132--142, Taipei, Taiwan, March 2008.
[ BibTex | Web page | PDF ]

[BMO⁺08]

P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On Termination for Faulty Channel Machines. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS'08), volume 1 of Leibniz International Proceedings in Informatics, pages 121--132, Bordeaux, France, February 2008. Leibniz-Zentrum für Informatik.
[ BibTex | Web page | PS | PDF ]

[BBL08]

P. Bouyer, E. Brinksma, and K. G. Larsen. Optimal Infinite Scheduling for Multi-Priced Timed Automata. Formal Methods in System Design, 32(1):2--23, February 2008.
doi: 10.1007/s10703-007-0043-4.
[ BibTex | DOI | Web page | PS | PDF ]

[BHR08]

P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. Information and Computation, 206(1):73--107, January 2008.
doi: 10.1016/j.ic.2007.10.004.
[ BibTex | DOI | Web page | PDF ]

[BL08]

P. Bouyer and F. Laroussinie. Model Checking Timed Automata. In Modeling and Verification of Real-Time Systems, pages 111--140. ISTE Ltd. -- John Wiley & Sons, Ltd., January 2008.
[ BibTex | Web page | PDF ]

[BBB⁺07]

C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, and M. Größer. Probabilistic and Topological Semantics for Timed Automata. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 179--191, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_15.
[ BibTex | DOI | Web page | PDF ]

[BM07]

P. Bouyer and N. Markey. Costs are Expensive! In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'07), volume 4763 of Lecture Notes in Computer Science, pages 53--68, Salzburg, Austria, October 2007. Springer.
doi: 10.1007/978-3-540-75454-1_6.
[ BibTex | DOI | Web page | PS | PDF ]

[BBBR07]

P. Bouyer, Th. Brihaye, V. Bruyère, and J.-F. Raskin. On the optimal reachability problem on weighted timed automata. Formal Methods in System Design, 31(2):135--175, October 2007.
doi: 10.1007/s10703-007-0035-4.
[ BibTex | DOI | Web page | PS | PDF ]

[BMOW07]

P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. The Cost of Punctuality. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 109--118, Wroclaw, Poland, July 2007. IEEE Computer Society Press.
doi: 10.1109/LICS.2007.49.
[ BibTex | DOI | Web page | PS | PDF ]

[BBC07]

P. Bouyer, Th. Brihaye, and F. Chevalier. Weighted O-Minimal Hybrid Systems are more Decidable than Weighted Timed Automata! In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 69--83, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_6.
[ BibTex | DOI | Web page | PS | PDF ]

[BLM07]

P. Bouyer, K. G. Larsen, and N. Markey. Model-Checking One-Clock Priced Timed Automata. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 108--122, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_9.
[ BibTex | DOI | Web page | PS | PDF ]

[BLMR06]

P. Bouyer, K. G. Larsen, N. Markey, and J. I. Rasmussen. Almost Optimal Strategies in One-Clock Priced Timed Automata. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 345--356, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_32.
[ BibTex | DOI | Web page | PS | PDF ]

[B⁺06]

P. Bouyer et al. ACI Sécurité Informatique CORTOS --- Rapport final, November 2006. 17 pages.
[ BibTex | Web page | PDF ]

[BBBL06]

H. Bel mokadem, B. Bérard, P. Bouyer, and F. Laroussinie. Timed temporal logics for abstracting transient states. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 337--351, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_26.
[ BibTex | DOI | Web page | PDF ]

[BHR06c]

P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Unfoldings for Networks of Timed Automata. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 292--306, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_23.
[ BibTex | DOI | Web page | PS | PDF ]

[BBC06a]

P. Bouyer, L. Bozzelli, and F. Chevalier. Controller Synthesis for MTL Specifications. In Proceedings of the 17th International Conference on Concurrency Theory (CONCUR'06), volume 4137 of Lecture Notes in Computer Science, pages 450--464, Bonn, Germany, August 2006. Springer.
doi: 10.1007/11817949_30.
[ BibTex | DOI | Web page | PS | PDF ]

[BBC06b]

P. Bouyer, Th. Brihaye, and F. Chevalier. Control in o-Minimal Hybrid Systems. In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pages 367--378, Seattle, Washington, USA, August 2006. IEEE Computer Society Press.
doi: 10.1109/LICS.2006.22.
[ BibTex | DOI | Web page | PS | PDF ]

[BHR06b]

P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) --- Part II, volume 4052 of Lecture Notes in Computer Science, pages 420--431, Venice, Italy, July 2006. Springer.
doi: 10.1007/11787006_36.
[ BibTex | DOI | Web page | PS | PDF ]

[BBLP06]

G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata. International Journal on Software Tools for Technology Transfer, 8(3):204--215, June 2006.
doi: 10.1007/s10009-005-0190-0.
[ BibTex | DOI | Web page | PS | PDF ]

[BC06]

P. Bouyer and F. Chevalier. On the Control of Timed and Hybrid Systems. EATCS Bulletin, 89:79--96, June 2006.
[ BibTex | Web page | PS | PDF ]

[BBM06]

P. Bouyer, Th. Brihaye, and N. Markey. Improved Undecidability Results on Weighted Timed Automata. Information Processing Letters, 98(5):188--194, June 2006.
doi: 10.1016/j.ipl.2006.01.012.
[ BibTex | DOI | Web page | PS | PDF ]

[BHR06a]

P. Bouyer, S. Haddad, and P.-A. Reynier. Extended Timed Automata and Time Petri Nets. In Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD'06), pages 91--100, Turku, Finland, June 2006. IEEE Computer Society Press.
doi: 10.1109/ACSD.2006.6.
[ BibTex | DOI | Web page | PS | PDF ]

[BL06]

P. Bouyer and F. Laroussinie. Vérification par automates temporisés. In Systèmes temps-réel 1 : techniques de description et de vérification, pages 121--150. Hermès, June 2006.
[ BibTex | Web page | PS | PDF ]

[Bou06]

P. Bouyer. Weighted Timed Automata: Model-Checking and Games. In Proceedings of the 22nd Conference on Mathematical Foundations of Programming Semantics (MFPS'06), volume 158 of Electronic Notes in Theoretical Computer Science, pages 3--17, Genova, Italy, May 2006. Elsevier Science Publishers. Invited paper.
doi: 10.1016/j.entcs.2006.04.002.
[ BibTex | DOI | Web page | PS | PDF ]

[BMR06]

P. Bouyer, N. Markey, and P.-A. Reynier. Robust Model-Checking of Linear-Time Properties in Timed Automata. In Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06), volume 3887 of Lecture Notes in Computer Science, pages 238--249, Valdivia, Chile, March 2006. Springer.
doi: 10.1007/11682462_25.
[ BibTex | DOI | Web page | PS | PDF ]

[BCM05]

P. Bouyer, F. Chevalier, and N. Markey. On the Expressiveness of TPTL and MTL. In Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), volume 3821 of Lecture Notes in Computer Science, pages 432--443, Hyderabad, India, December 2005. Springer.
doi: 10.1007/11590156_35.
[ BibTex | DOI | Web page | PS | PDF ]

[BLR05]

P. Bouyer, F. Laroussinie, and P.-A. Reynier. Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. In Proceedings of the 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'05), volume 3829 of Lecture Notes in Computer Science, pages 112--126, Uppsala, Sweden, November 2005. Springer.
doi: 10.1007/11603009_10.
[ BibTex | DOI | Web page | PS | PDF ]

[BCKT05]

P. Bouyer, F. Chevalier, M. Krichen, and S. Tripakis. Observation partielle des systèmes temporisés. In Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05), pages 381--393, Autrans, France, October 2005. Hermès.
[ BibTex | Web page | PS | PDF ]

[ABC⁺05]

K. Altisen, P. Bouyer, T. Cachat, F. Cassez, and G. Gardey. Introduction au contrôle des systèmes temps-réel. In Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05), pages 367--380, Autrans, France, October 2005. Hermès.
[ BibTex | Web page | PS | PDF ]

[Bou05d]

P. Bouyer. Optimal Timed Games. Invited talk, 5th International Workshop on Automated Verification of Critical Systems (AVoCS'05), Warwick, UK, September 2005.
[ BibTex ]

[Bou05b]

P. Bouyer. An Introduction to Timed Automata. In Actes de la 4ème École Temps-Réel (ETR'05), pages 111--123, Nancy, France, September 2005.
[ BibTex | Web page | PDF ]

[Bou05a]

P. Bouyer. Foundations of Timed Systems. In Proc. of the ARTIST2 Summer School on Component & Modelling, Testing & Verification, and Statical Analysis of Embedded Systems, Nässlingen, Sweden, September-October 2005.
[ BibTex | Web page | PDF ]

[BBBL05]

H. Bel mokadem, B. Bérard, P. Bouyer, and F. Laroussinie. A New Modality for Almost Everywhere Properties in Timed Automata. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 110--124, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_12.
[ BibTex | DOI | Web page | PS | PDF ]

[BCL05]

P. Bouyer, F. Cassez, and F. Laroussinie. Modal Logics for Timed Control. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 81--94, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_10.
[ BibTex | DOI | Web page | PS | PDF ]

[Bou05h]

P. Bouyer. Weighted Timed Automata: Model-Checking and Games. Invited talk, Workshop CORTOS'06, Bonn, Germany, August 2005.
[ BibTex ]

[Bou05c]

P. Bouyer. Optimal Reachability Timed Games. Invited talk, 7th International Workshop on Verification of Infinite State Systems (INFINITY'05), San Francisco, USA, August 2005.
[ BibTex ]

[Bou05e]

P. Bouyer. Partial Observation of Timed Systems. Invited talk, 2nd Workshop on Games in Design and Verification, Edinburgh, Scotland, July 2005.
[ BibTex ]

[BCD05]

P. Bouyer, F. Chevalier, and D. D'Souza. Fault Diagnosis Using Timed Automata. In Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'05), volume 3441 of Lecture Notes in Computer Science, pages 219--233, Edinburgh, Scotland, UK, April 2005. Springer.
doi: 10.1007/b106850.
[ BibTex | DOI | Web page | PS | PDF ]

[B⁺05]

P. Bouyer et al. ACI Sécurité Informatique CORTOS << Control and Observation of Real-Time Open Systems >> --- Rapport à mi-parcours, April 2005. 6 pages.
[ BibTex | Web page | PDF ]

[Bou05g]

P. Bouyer. Timed Automata and Extensions: Decidability Limits. Invited talk, 5èmes Journées Systèmes Infinis (JSI'05), Cachan, France, March 2005.
[ BibTex ]

[Bou05f]

P. Bouyer. Synthesis of Timed Systems. Invited lecture, Spring School on Infinite Games and Their Applications, Bonn, Germany, March 2005.
[ BibTex ]

[BCFL05]

P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen. Synthesis of Optimal Strategies Using HyTech. In Proceedings of the Workshop on Games in Design and Verification (GDV'04), volume 119 of Electronic Notes in Theoretical Computer Science, pages 11--31, Boston, Massachusetts, USA, February 2005. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2004.07.006.
[ BibTex | DOI | Web page | PS | PDF ]

[BC05]

P. Bouyer and F. Chevalier. On Conciseness of Extensions of Timed Automata. Journal of Automata, Languages and Combinatorics, 10(4):393--405, 2005.
[ BibTex | Web page | PS | PDF ]

[Bou04c]

P. Bouyer. Timed Automata --- From Theory to Implementation. Invited tutorial, 6th Winter School on Modelling and Verifying Parallel Processes (MOVEP'04), Brussels, Belgium, December 2004. 27 pages.
[ BibTex ]

[BCFL04]

P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen. Optimal Strategies in Priced Timed Game Automata. In Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), volume 3328 of Lecture Notes in Computer Science, pages 148--160, Chennai, India, December 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[Bou04d]

P. Bouyer. Timed Automata --- From Theory to Implementation. Invited tutorial, 1st International Conference on the Quantitative Evaluation of System (QEST'04), Twente, The Netherlands, September 2004.
[ BibTex ]

[BDFP04]

P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Updatable Timed Automata. Theoretical Computer Science, 321(2-3):291--345, August 2004.
doi: 10.1016/j.tcs.2004.04.003.
[ BibTex | DOI | Web page | PS | PDF ]

[BBP04]

B. Bérard, P. Bouyer, and A. Petit. Analysing the PGM Protocol with Uppaal. International Journal of Production Research, 42(14):2773--2791, July 2004.
[ BibTex | Web page | PS | PDF ]

[Bou04b]

P. Bouyer. Forward Analysis of Updatable Timed Automata. Formal Methods in System Design, 24(3):281--320, May 2004.
doi: 10.1023/B:FORM.0000026093.21513.31.
[ BibTex | DOI | Web page | PS | PDF ]

[Bou04e]

P. Bouyer. Timed Models for Concurrent Systems. Invited lecture, 32nd Spring School on Theoretical Computer Science (Concurrency Theory), Luminy, France, April 2004.
[ BibTex ]

[BBL04]

P. Bouyer, E. Brinksma, and K. G. Larsen. Staying Alive As Cheaply As Possible. In Proceedings of the 7th International Conference on Hybrid Systems: Computation and Control (HSCC'04), volume 2993 of Lecture Notes in Computer Science, pages 203--218, Philadelphia, Pennsylvania, USA, March 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[BBLP04]

G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek. Lower and Upper Bounds in Zone Based Abstractions of Timed Automata. In Proceedings of the 10th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'04), volume 2988 of Lecture Notes in Computer Science, pages 312--326, Barcelona, Spain, March 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[Bou04a]

P. Bouyer. Automates temporisés, de la théorie à l'implémentation. Invited talk, Journées Formalisation des Activit?s Concurrentes (FAC'04), Toulouse, France, March 2004.
[ BibTex ]

[BBP03]

B. Bérard, P. Bouyer, and A. Petit. Une analyse du protocole PGM avec UPPAAL. In Actes du 4ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'03), pages 415--430, Metz, France, October 2003. Hermès.
[ BibTex | Web page | PS ]

[BDMP03]

P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed Control with Partial Observability. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03), volume 2725 of Lecture Notes in Computer Science, pages 180--192, Boulder, Colorado, USA, July 2003. Springer.
[ BibTex | Web page | PS | PDF ]

[ABBL03]

L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen. The Power of Reachability Testing for Timed Automata. Theoretical Computer Science, 300(1-3):411--475, May 2003.
doi: 10.1016/S0304-3975(02)00334-1.
[ BibTex | DOI | Web page | PS ]

[BPT03]

P. Bouyer, A. Petit, and D. Thérien. An Algebraic Approach to Data Languages and Timed Languages. Information and Computation, 182(2):137--162, May 2003.
[ BibTex | Web page | PS | PDF ]

[BBFL03]

G. Behrmann, P. Bouyer, E. Fleury, and K. G. Larsen. Static Guard Analysis in Timed Automata Verification. In Proceedings of the 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'03), volume 2619 of Lecture Notes in Computer Science, pages 254--277, Warsaw, Poland, April 2003. Springer.
[ BibTex | Web page | PS | PDF ]

[Bou03]

P. Bouyer. Untameable Timed Automata! In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), volume 2607 of Lecture Notes in Computer Science, pages 620--631, Berlin, Germany, February 2003. Springer.
[ BibTex | Web page | PS | PDF ]

[Bou02a]

P. Bouyer. A Logical Characterization of Data Languages. Information Processing Letters, 84(2):75--85, October 2002.
[ BibTex | Web page | PS ]

[BBP02]

B. Bérard, P. Bouyer, and A. Petit. Analysing the PGM Protocol with UPPAAL. In Proceedings of the 2nd Workshop on Real-Time Tools (RT-TOOLS'02), Copenhagen, Denmark, August 2002. Uppsala University.
[ BibTex | Web page | PS ]

[Bou02b]

P. Bouyer. Modèles et algorithmes pour la vérification des systèmes temporisés. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2002.
[ BibTex | Web page | PS | PDF ]

[BP02]

P. Bouyer and A. Petit. A KleeneashBüchi-like Theorem for Clock Languages. Journal of Automata, Languages and Combinatorics, 7(2):167--186, 2002.
[ BibTex | Web page | PS ]

[BBP01]

B. Bérard, P. Bouyer, and A. Petit. Modélisation du protocole PGM et de certaines de ses propriétés en UPPAAL. Contract Report 4.4, projet RNRT Calife, November 2001. 18 pages.
[ BibTex ]

[BPT01]

P. Bouyer, A. Petit, and D. Thérien. An Algebraic Characterization of Data and Timed Languages. In Proceedings of the 12th International Conference on Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in Computer Science, pages 248--261, Aalborg, Denmark, August 2001. Springer.
[ BibTex | Web page | PS ]

[BDFP00b]

P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of Updatable Timed Automata. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pages 232--242, Bratislava, Slovakia, August 2000. Springer.
[ BibTex | Web page | PS ]

[BDFP00a]

P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are Timed Automata Updatable? In Proceedings of the 12th International Conference on Computer Aided Verification (CAV 2000), volume 1855 of Lecture Notes in Computer Science, pages 464--479, Chicago, Illinois, USA, July 2000. Springer.
[ BibTex | Web page | PS ]

[BFP00]

P. Bouyer, E. Fleury, and A. Petit. Document de synthèse sur les procédures de vérification des systèmes temps réel : Les automates temporisés. Fourniture 4.2 du projet RNRT Calife, January 2000.
[ BibTex ]

[BP99]

P. Bouyer and A. Petit. Decomposition and Composition of Timed Automata. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of Lecture Notes in Computer Science, pages 210--219, Prague, Czech Republic, July 1999. Springer.
[ BibTex | Web page | PS ]

[ABBL98]

L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen. The Power of Reachability Testing for Timed Automata. In Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'98), volume 1530 of Lecture Notes in Computer Science, pages 245--256, Chennai, India, December 1998. Springer.
[ BibTex | Web page | PS ]

[Bou98]

P. Bouyer. Automates temporisés et modularité. Rapport de DEA, DEA Algorithmique, Paris, France, June 1998.
[ BibTex | Web page | PS ]

This file was generated by bibtex2html 1.98.