1985-2022 Publications

• 2022
  • B. Bérard, B. Bollig, P. Bouyer, M. Függer, N. Sznajder : “Synthesis in presence of dynamic links”, Information and Computation, vol. 289 (Part B), pp. 104856, (Elsevier) (2022)
  • B. Bérard, S. Haddad : “Revisiting Reachability in Polynomial Interrupt Timed Automata”, Information Processing Letters, vol. 174, pp. 106208, (Elsevier) (2022)
• 2021
  • B. Bérard, S. Haddad, C. Picaronny, M. Safey El Din, M. Sassolas : “Polynomial interrupt timed automata: Verification and expressiveness”, Information and Computation, vol. 277, pp. 104580, (Elsevier) (2021)
• 2020
  • B. Bérard, B. Bollig, P. Bouyer, M. Függer, N. Sznajder : “Synthesis in Presence of Dynamic Links”, Proceedings of the 11^th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), Brussels (online), Belgium (2020)
  • N. Sznajder, B. Bérard, B. Bollig, M. Lehaut : “Parameterized Synthesis for Fragments of First-Order Logic over Data Words”, Proceedings of the 23^rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), vol. 12077, Lecture Notes in Computer Science, Dublin, Ireland, pp. 97-118, (Springer) (2020)
• 2018
  • B. Bérard, S. Haar, L. Hélouët : “Hyper Partial Order Logic”, 38^th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, vol. 122, Leibniz International Proceedings in Informatics (LIPIcs), Ahmedabad, India, pp. 20:1-20:21, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2018)
  • B. Bérard, P. Bouyer, V. Jugé : “Finite Bisimulations for Dynamical Systems with Overlapping Trajectories”, LIPICS, vol. 119, Birmingham, United Kingdom, pp. 26:1-26:17, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2018)
  • B. Bérard, S. Haar, S. Schmitz, S. Schwoon : “The Complexity of Diagnosability and Opacity Verification for Petri Nets”, Fundamenta Informaticae, vol. 161 (4), pp. 317-349, (Polskie Towarzystwo Matematyczne) (2018)
  • B. Barbot, B. Bérard, Y. Duplouy, S. Haddad : “Integrating Simulink Models into the Model Checker Cosmos”, Application and Theory of Petri Nets and Concurrency - Petri Nets 2018, vol. 10877, Lecture Notes in Computer Sciences, Bratislava, Slovakia, pp. 363-373, (Springer) (2018)
  • B. Barbot, B. Bérard, Y. Duplouy, S. Haddad : “Integrating Simulink Models into the Model Checker Cosmos”, (2018)
  • B. Bérard, O. Kouchnarenko, J. Mullins, M. Sassolas : “Opacity for linear constraint Markov chains”, Discrete Event Dynamic Systems, vol. 28 (1), pp. 83-108, (Springer Verlag) (2018)
• 2017
  • B. Bérard, S. Haddad, E. Lefaucheux : “Probabilistic Disclosure: Maximisation vs. Minimisation”, FSTTCS 2017, Kanpur, India, pp. 13:1-13:14 (2017)
  • B. Bérard, Y. Duplouy, S. Haddad : “Une sémantique formelle pour les modèles Simulink”, Actes de l'École d'été Temps Réel 2017, Paris, France (2017)
  • B. Bérard, S. Haar, S. Schmitz, S. Schwoon : “The Complexity of Diagnosability and Opacity Verification for Petri Nets”, Petri nets 2017 - 38^th International Conference on Applications and Theory of Petri Nets and Concurrency, vol. 10258, Lecture Notes in Computer Science, Zaragoza, Spain, pp. 200-220, (Springer) (2017)
  • B. Barbot, B. Bérard, Y. Duplouy, S. Haddad : “Statistical Model-Checking for Autonomous Vehicle Safety Validation”, Conference SIA Simulation Numérique, Montigny-le-Bretonneux, France (2017)
  • B. Bérard, L. Hélouët, J. Mullins : “Non-interference in partial order models”, ACM Transactions on Embedded Computing Systems (TECS), vol. 16 (2), Application and Theory of Petri Nets and Other Models of Concurrency: Special Issue of Selected Papers from Petri Nets 2015, pp. 44:1-44:34, (ACM) (2017)
• 2016
  • B. Bérard, O. Kouchnarenko, J. Mullins, M. Sassolas : “Opacity for Linear Constraint Markov Chains”, (2016)
  • B. Bérard, S. Haddad, A. Jovanovic, D. Lime : “Interrupt Timed Automata with Auxiliary Clocks and Parameters”, Fundamenta Informaticae, vol. 143 (3-4), pp. 235-259, (Polskie Towarzystwo Matematyczne) (2016)
  • B. Bérard, P. Lafourcade, L. Millet, M. Potop‑Butucaru, Y. Thierry‑Mieg, S. Tixeuil : “Formal verification of mobile robot protocols”, Distributed Computing, vol. 29 (6), pp. 459-487, (Springer Verlag) (2016)
  • B. Bérard, O. Kouchnarenko, J. Mullins, M. Sassolas : “Preserving opacity on Interval Markov Chains under simulation”, Proceedings of 13^th International Workshop on Discrete Event Systems (WODES) 2016, IEEE, Xi'an, China, pp. 319-324 (2016)
• 2015
  • B. Bérard, L. Hélouët, J. Mullins : “Non-interference in partial order models”, ACSD'15 - 15^th International Conference on Application of Concurrency to System Design, Brussels, Belgium, pp. 80-89, (IEEE) (2015)
  • B. Bérard, J. Mullins, M. Sassolas : “Quantifying Opacity”, Mathematical Structures in Computer Science, vol. 25 (Special issue 2), pp. 361-403, (Cambridge University Press (CUP)) (2015)
  • B. Bérard, K. Chatterjee, N. Sznajder : “Probabilistic Opacity for Markov Decision Processes”, Information Processing Letters, vol. 115 (1), pp. 52-59, (Elsevier) (2015)
  • B. Bérard, S. Haddad, C. Picaronny, M. Safey El Din, M. Sassolas : “Polynomial Interrupt Timed Automata”, The 9^th Workshop on Reachability Problems (RP'15), vol. 9328, Lecture Notes in Computer Science, Warsaw, Poland, pp. 20-32, (Springer) (2015)
  • B. Bérard, P. Courtieu, L. Millet, M. Potop‑Butucaru, L. Rieg, N. Sznajder, S. Tixeuil, X. Urbain : “[Invited Paper] Formal Methods for Mobile Robots: Current Results and Open Problems”, International Journal of Informatics Society, vol. 7 (3), pp. 101-114, (Japan Informatics Society) (2015)
  • B. Bérard, O. Kouchnarenko, J. Mullins, M. Sassolas : “Probabilistic Opacity in Refinement-Based Modeling”, (2015)
• 2014
  • B. Bérard, J. Mullins : “Verification of Information Flow Properties under Rational Observation”, 14^th Int. Workshop on Automated Verification of Critical Systems, Enschede, Netherlands, pp. 61-75, (CTIT – Institute for ICT Research in Context, University of Twente) (2014)
  • Y. Zhang, B. Bérard, L. Hillah, F. Kordon, Y. Thierry‑Mieg : “Controllability for Discrete Event Systems Modeled in VeriJ”, International Journal of Critical Computer-Based Systems, vol. 5 (3/4), pp. 218-240, (Inderscience) (2014)
  • M. BenabdelHafid, B. Bérard, M. Boufaïda : “Analyzing Behavioral Compatibility for Web Service Choreography Using Colored Petri Nets and ASK-CTL”, 6^th International Conference on Advanced Service Computing, Venice, Italy, pp. 32-39, (Xpert Publishing Services) (2014)
  • B. Bérard, O. Carton : “Channel Synthesis Revisited”, 8^th International Conference on Languages and Automata Theory and Applications -- LATA, vol. 8370, Lecture Notes in Computer Science, Madrid, Spain, pp. 149-160, (Springer International Publishing) (2014)
• 2013
  • B. Bérard, O. Carton : “Channel synthesis revisited”, (2013)
  • Y. Zhang, B. Bérard, L. Hillah, Y. Thierry‑Mieg : “Semi-Automatic Controller Design of Java-like Models”, Workshop on Formal Techniques for Java-like Programs, FTfJP 2013, Montpellier, France, pp. 3:1-3:7, (ACM) (2013)
  • B. Bérard, F. Cassez, S. Haddad, D. Lime, O. Roux : “The Expressive Power of Time Petri Nets”, Theoretical Computer Science, vol. 474, pp. 1-20, (Elsevier) (2013)
  • B. Bérard, S. Haddad, A. Jovanovic, D. Lime : “Parametric Interrupt Timed Automata”, 7^th Workshop on Reachability Problems in Computational Models (RP'13), vol. 8169, Lecture Notes in Computer Science, Uppsala, Sweden, pp. 59-69, (Springer Berlin Heidelberg) (2013)
  • B. Bérard, L. Millet, M. Gradinariu Potop‑Butucaru, Y. Thierry‑Mieg, S. Tixeuil : “Vérification formelle et robots mobiles”, 15^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pp. 1-4, (Nisse, Nicolas et Rousseau, Franck et Busnel, Yann) (2013)
  • B. Bérard : “An Introduction to Timed Automata”, chapter in Control of Discrete-Event Systems, vol. 433, Lecture Notes in Control and Information Science, pp. 169-187, (Springer) (2013)
  • B. Bérard, L. Millet, M. Potop‑Butucaru, Y. Thierry‑Mieg, S. Tixeuil : “Formal verification of Mobile Robot Protocols”, (2013)
  • B. Bérard, M. Cabasino, A. Febbraro, A. Giua, C. Seatzu : “Petri nets with time”, chapter in Control of Discrete-Event Systems, vol. 433, Lecture Notes in Control and Information Science, pp. 319-342, (Springer) (2013)
• 2012
  • F. Kordon, B. Bérard, Y. Thierry‑Mieg, Y. Ben Maïssa : “Hierarchy is Good For Discrete Time: a Compositional Approach to Discrete Time Verification”, Dagstuhl seminar "Architecture-Driven Semantic Analysis of Embedded Systems", Dagstuhl, Germany, pp. 38-39 (2012)
  • B. Bérard, S. Haddad, M. Sassolas : “Interrupt Timed Automata: verification and expressiveness”, Formal Methods in System Design, vol. 40 (1), pp. 41-87, (Springer Verlag) (2012)
  • B. Bérard, S. Haddad, M. Sassolas, N. Sznajder : “Concurrent Games on VASS with Inhibition”, 23^rd International Conference on Concurrency Theory (CONCUR'12), vol. 7454, Lecture Notes in Computer Science, Newcastle upon Tyne, United Kingdom, pp. 39-52, (Springer) (2012)
  • G. Benattar, B. Bérard, D. Lime, J. Mullins, O. Roux, M. Sassolas : “Channel Synthesis for Finite Transducers”, International Journal of Foundations of Computer Science, vol. 23 (6), pp. 1241-1260, (World Scientific Publishing) (2012)
• 2011
  • Y. Zhang, B. Bérard, L. Hillah, F. Kordon, Y. Thierry‑Mieg : “Modeling complex systems with VeriJ”, 5^th Verification and Evaluation of Computer and Communication System (VECOS), Tunis, Tunisia, pp. 34-45, (British Informatics Society Ltd) (2011)
  • Y. Thierry‑Mieg, B. Bérard, F. Kordon, D. Lime, O. Roux : “{Compositional Analysis of Discrete Time Petri nets}”, 1^st workshop on Petri Nets Compositions (CompoNet 2011), vol. 726, CEUR-WS, Newcastle, United Kingdom, pp. 17-31, (CEUR) (2011)
  • B. Bérard, J. Mullins, M. Sassolas : “Quantifying Opacity”, (2011)
  • G. Benattar, B. Bérard, D. Lime, J. Mullins, O. Roux, M. Sassolas : “Channel Synthesis for Finite Transducers”, AFL 2011 - 13^th International Conference on Automata and Formal Languages, Debrecen, Hungary, pp. 79-92 (2011)
  • B. Bérard : “Modeling Time”, chapter in Models and Analysis in Distributed Systems n°4, pp. 63-96, (Wiley), (ISBN: 9781848213142) (2011)
• 2010
  • H. Bel Mokadem, B. Bérard, V. Gourcuff, O. De Smet, J.‑M. Roussel : “Verification of a timed multitask system with UPPAAL”, IEEE Transactions on Automation Science and Engineering, vol. 7 (4), pp. 921-932, (Institute of Electrical and Electronics Engineers) (2010)
  • Y. Zhang, B. Bérard, F. Kordon, Y. Thierry‑Mieg : “Automated Controllability and Synthesis with Hierarchical Set Decision Diagrams”, 11^th International Workshop on Discrete Event Systems (WODES'10), Berlin, Germany, pp. 281-286, (IFAC/Elsevier) (2010)
  • G. Benattar, B. Bérard, D. Lime, J. Mullins, O. Roux, M. Sassolas : “Covert Channel Synthesis for Transducers”, (2010)
  • B. Bérard, J. Mullins, M. Sassolas : “Quantifying Opacity”, 7^th International Conference on Quantitative Evaluation of Systems (QEST 2010), Williamsburg, Virginia, United States, pp. 263-272, (IEEE Computer Society) (2010)
  • B. Bérard, S. Haddad, M. Sassolas : “Real Time Properties for Interrupt Timed Automata”, 17^th International Symposium on Temporal Representation (TIME 2010), Paris, France, pp. 69-76, (IEEE Computer Society Press) (2010)
  • B. Bérard, S. Haddad, M. Sassolas, M. Zeitoun : “Distributed Synthesis with Incomparable Information”, (2010)
• 2009
  • G. Benattar, B. Bérard, D. Lime, J. Mullins, O. Roux, M. Sassolas : “Covert Channels with Transducers”, Proceedings of the LICS Workshop on Foundations of Computer Security (FCS'09), Los Angeles, California, United States (2009)
  • B. Bérard, S. Haddad : “Interrupt Timed Automata”, Proceedings of the 12^th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), vol. 5504, Lecture Notes in Computer Science, York, United Kingdom, pp. 197-211, (Springer) (2009)
  • B. Bérard : “Timed Model Checking”, chapter in Communicating Embedded Systems -- Software and Design, (ISTE Publishing / John Wiley), (ISBN: 978-1-8482-1143-8) (2009)
• 2008
  • B. Bérard, S. Haddad, L. Hillah, F. Kordon, Y. Thierry‑Mieg : “Collision Avoidance in Intelligent Transport Systems: towards an Application of Control Theory”, 9^th International Workshop on Discrete Event Systems (WODES'08), Goteborg, Sweden, pp. 346-351, (IEEE Computer Society) (2008)
  • B. Bérard : “Model checking temporisé”, chapter in Approches formelles des systèmes embarqués communicants, Traités IC2 - Informatique et systèmes d'information, pp. 75-103, (Hermes/Lavoisier), (ISBN: 978-2-7462-1942-7) (2008)
  • B. Bérard, F. Cassez, S. Haddad, D. Lime, O. Roux : “When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?”, Theoretical Computer Science, vol. 403 (2--3), pp. 202-220, (Elsevier) (2008)
  • B. Bérard : “Model checking temporisé”, chapter in Approches formelles des systèmes embarqués communicants, Traités IC2 - Informatique et systèmes d'information, O. Roux, C. Jard (Eds.), pp. 75-103, (Hermes/Lavoisier), (ISBN: 978-2-7462-1942-7) (2008)
• 2007
  • B. Bérard, P. Gastin, A. Petit : “Timed substitutions for regular signal-event languages”, Formal Methods in System Design, vol. 31 (2), pp. 101-134, (Springer netherlands) (2007)
• 2006
  • B. Bérard, F. Cassez, S. Haddad, D. Lime, O. Roux : “Comparison of Expressiveness for Timed Automata and Time Petri Nets”, (2006)
  • B. Bérard, P. Gastin, A. Petit : “Intersection of regular signal-event (timed) languages”, Proceedings of the 4^th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), vol. 4202, Lecture Notes in Computer Science, E. Asarin, P. Bouyer (Eds.), Paris, France, pp. 52-66, (Springer) (2006)
  • B. Bérard, P. Gastin, A. Petit : “Refinements and abstractions of signal-event (timed) languages”, Proceedings of the 4^th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), vol. 4202, Lecture Notes in Computer Science, E. Asarin, P. Bouyer (Eds.), Paris, France, pp. 67-81, (Springer) (2006)
  • H. Bel mokadem, B. Bérard, P. Bouyer, F. Laroussinie : “Timed temporal logics for abstracting transient states”, Proceedings of the 4^th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), vol. 4218, Lecture Notes in Computer Science, S. Graf, W. Zhang (Eds.), Beijing, ROC, pp. 337-351, (Springer) (2006)
  • B. Bérard : “Modèles temporisés”, chapter in Méthodes Formelles pour les Systèmes Répartis et Coopératifs, S. Haddad, F. Kordon, L. Petrucci (Eds.), pp. 51-81, (Hermes/Lavoisier), (ISBN: 2-7462-1447-4) (2006)
• 2005
  • B. Bérard, F. Cassez, S. Haddad, D. Lime, O. Roux : “Comparison of the Expressiveness of Timed Automata and Time Petri Nets”, FORMATS 2005 - 3^rd International Conference on Formal Modeling and Analysis of Timed Systems, vol. 3829, Lecture Notes in Computer Science, Uppsala, Sweden, pp. 211-225, (Springer-Verlag) (2005)
  • H. Bel Mokadem, B. Bérard, V. Gourcuff, J.‑M. Roussel, O. De Smet : “Verification of a timed multitask system with UPPAAL”, CDROM paper, Catania, Italy, pp. cf-000606 (2005)
  • B. Bérard, F. Cassez, S. Haddad, D. Lime, O. Roux : “When are Timed Automata weakly timed bisimilar to Time Petri Nets ?”, 25^th Int. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), Chennai, India, pp. 276-284 (2005)
  • B. Bérard, F. Cassez, S. Haddad, D. Lime, O. Roux : “Comparison of Different Semantics for Time Petri Nets”, 3^rd Int. Symp. on Automated Technology for Verification and Analysis (ATVA'05), vol. 3707, Taiwan, Taiwan, Province of China, pp. 293-307, (Copyright \beginrawhtmlSpringer\endrawhtml) (2005)
  • M. Ben Gaid, B. Bérard, O. De Smet : “Verification of an evaporator system with Uppaal”, Journal Européen des Systèmes Automatisés, vol. 39 (9-10), pp. 1079-1098 (2005)
  • H. Bel mokadem, B. Bérard, P. Bouyer, F. Laroussinie : “A New Modality for Almost Everywhere Properties in Timed Automata”, Proceedings of the 16^th International Conference on Concurrency Theory (CONCUR'05), vol. 3653, Lecture Notes in Computer Science, M. Abadi, L. De Alfaro (Eds.), San Francisco, CA, USA, pp. 110-124, (Springer) (2005)
  • B. Bérard, F. Cassez, S. Haddad, D. Lime, O. Roux : “Comparison of Different Semantics for Time Petri Nets”, Automated Technology for Verification and Analysis (ATVA'05), vol. 3707, Lecture Notes in Computer Science, Taipei, Taiwan, pp. 293-307, (Springer) (2005)
  • H. Bel mokadem, B. Bérard, V. Gourcuff, J.‑M. Roussel, O. De Smet : “Verification of a timed multitask system with Uppaal”, Proceedings of the 10^th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'05), Catania, Italy, pp. 347-354, (IEEE Industrial Electronics Society) (2005)
• 2004
  • B. Bérard, P. Bouyer, A. Petit : “Analysing the PGM Protocol with Uppaal”, International Journal of Production Research, vol. 42 (14), pp. 2773-2791, (Taylor and Francis) (2004)
  • M. Ben Gaid, B. Bérard, O. De Smet : “Modélisation et vérification d’un évaporateur en UPPAAL”, Actes du 6^e Atelier sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'04), J. Julliand (Ed.), Besancon, France, pp. 223-238 (2004)
• 2003
  • B. Bérard, L. Fribourg, F. Klay, J.‑F. Monin : “A Compared Study of Two Correctness Proofs for the Standardized Algorithm of ABR Conformance”, Formal Methods in System Design, vol. 22 (1), pp. 59-86, (Kluwer Academic Publishers) (2003)
  • B. Bérard, P. Bouyer, A. Petit : “Une analyse du protocole PGM avec UPPAAL”, Actes du 4^e Colloque sur la Modélisation des Systèmes Réactifs (MSR'03), D. Méry, N. Rezg, X. Xie (Eds.), Metz, France, pp. 415-430, (Hermès) (2003)
  • B. Bérard : “Logiciel libre et sûreté de fonctionnement: cas des systèmes critiques”, (Hermès), (ISBN: 2746207273) (2003)
  • B. Bérard, F. Laroussinie : “Vérification compositionnelle des p-automates”, n°(Lot~4.1 fourniture~1), Projet RNTL Averroes (2003)
• 2002
  • B. Bérard : “Vérification de modèles temporisés”, thesis (2002)
• 2001
  • J. Beauquier, B. Bérard, L. Fribourg, F. Magniette : “Proving Convergence of Self-Stabilizing Systems Using First-Order Rewriting and Regular Languages”, Distributed Computing, vol. 14 (2), pp. 83-95, (Springer) (2001)
  • B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, Ph. Schnoebelen : “Systems and Software Verification. Model-Checking Techniques and Tools”, (Springer) (2001)
  • B. Bérard, P. Bouyer, A. Petit : “Modélisation du protocole PGM et de certaines de ses propriétés en UPPAAL”, n°4.4, projet RNRT Calife (2001)
• 2000
  • B. Bérard, C. Picaronny : “Accepting Zeno Words: A Way Toward Timed Refinements”, Acta Informatica, vol. 37 (1), pp. 45-81, (Springer) (2000)
  • B. Bérard, C. Dufourd : “Timed Automata and Additive Clock Constraints”, Information Processing Letters, vol. 75 (1-2), pp. 1-7, (Elsevier Science Publishers) (2000)
  • B. Bérard, A. Labroue, Ph. Schnoebelen : “Verifying Performance Equivalence for Timed Basic Parallel Processes”, Proceedings of the 3^rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2000), vol. 1784, Lecture Notes in Computer Science, J. Tiuryn (Ed.), Berlin, Germany, pp. 35-47, (Springer) (2000)
  • B. Bérard, L. Sierra : “Comparing Verification with HyTech, Kronos and Uppaal on the Railroad Crossing Example”, n°LSV-00-2, Laboratoire Spécification et Vérification, ENS Cachan, France (2000)
  • B. Bérard, P. Castéran, E. Fleury, L. Fribourg, J.‑F. Monin, Ch. Paulin, A. Petit, D. Rouillard : “Document de spécification du modèle commun”, (2000)
• 1999
  • J. Beauquier, B. Bérard, L. Fribourg : “A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems”, Proceedings of the 13^th International Symposium on Distributed Computing (DISC'99), vol. 1693, Lecture Notes in Computer Science, P. Jayanti (Ed.), Bratislava, Slovak republic, pp. 240-253, (Springer) (1999)
  • B. Bérard, L. Fribourg : “Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol”, Proceedings of the 11^th International Conference on Computer Aided Verification (CAV'99), vol. 1633, Lecture Notes in Computer Science, N. Halbwachs, D. Peled (Eds.), Trento, Italy, pp. 96-107, (Springer) (1999)
  • B. Bérard, L. Fribourg : “Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic”, Proceedings of the 10^th International Conference on Concurrency Theory (CONCUR'99), vol. 1664, Lecture Notes in Computer Science, Jos C. M. Baeten, S. Mauw (Eds.), Eindhoven, The Netherlands, pp. 178-193, (Springer) (1999)
  • Ph. Schnoebelen, B. Bérard, M. Bidoit, F. Laroussinie, A. Petit : “Vérification de logiciels : techniques et outils du model-checking”, (Vuibert) (1999)
• 1998
  • B. Bérard, V. Diekert, P. Gastin, A. Petit : “Characterization of the Expressive Power of Silent Transitions in Timed Automata”, Fundamenta Informaticae, vol. 36 (2), pp. 145-182, (IOS Press) (1998)
  • B. Bérard, G. Cécé, C. Dufourd, A. Finkel, F. Laroussinie, A. Petit, Ph. Schnoebelen, G. Sutre : “Le model-checking, une technique de vérification en plein essor. II -- Quelques outils”, EDF/DER/MOS - LSV (1998)
  • B. Bérard, M. Bidoit, A. Petit : “Recommandations sur le cahier des charges SRC”, EDF/DER/MOS - LSV (1998)
• 1997
  • B. Bérard, C. Picaronny : “Accepting Zeno Words without Making Time Stand Still”, Proceedings of the 22^nd International Symposium on Mathematical Fundations of Computer Science (MFCS'97), vol. 1295, Lecture Notes in Computer Science, I. Prívara, P. Ruzicka (Eds.), Bratislava, Slovakia, pp. 149-158, (Springer) (1997)
  • B. Bérard, M. Bidoit : “Contribution du LSV à l’opération 2 : Étude de cas SRIC”, Action FORMA (1997)
  • B. Bérard, P. Gastin, A. Petit : “Refinement and Abstraction for Timed Languages”, n°LSV-97-3, Laboratoire Spécification et Vérification, ENS Cachan, France (1997)
• 1996
  • B. Bérard, P. Gastin, A. Petit : “On the Power of Non-Observable Actions in Timed Automata”, Proceedings of the 13^th Annual Symposium on Theoretical Aspects of Computer Science (STACS'96), vol. 1046, Lecture Notes in Computer Science, C. Puech, R. Reischuk (Eds.), Grenoble, France, pp. 257-268, (Springer) (1996)
• 1995
  • B. Bérard : “Untiming Timed Languages”, Information Processing Letters, vol. 55 (3), pp. 129-135, (Elsevier Science Publishers) (1995)
• 1994
  • B. Bérard : “Global Serializability of Concurrent Programs”, Theoretical Computer Science, vol. 124 (1), pp. 41-70, (Elsevier Science Publishers), (ISBN: 0304-3975) (1994)
• 1993
  • B. Bérard : “Sérialisabilité de programmes parallèles avec boucles”, Fondements du Parallélisme : Actes du 1^er Congrès Biennal de l'AFCET, Versailles, France, pp. 121-130, (AFCET) (1993)
• 1992
  • A. Arnold, J. Beauquier, B. Bérard, B. Rozoy : “Programmes parallèles, modèles et validation”, (Armand Colin) (1992)
• 1991
  • B. Bérard : “Static control through the serializability of concurrent programs”, Proceedings IMACS, Symp. on Modelling and Control of Technological Systems, Lille, pp. 653-658 (1991)
• 1990
  • J. Beauquier, B. Bérard : “Systèmes d’exploitations, concepts et algorithmes”, (Ediscience) (1990)
• 1987
  • B. Bérard : “Formal properties of literal shuffle”, Acta Cybernetica, vol. 8 (1), pp. 17-29 (1987)
  • B. Bérard : “Literal shuffle”, tcs, vol. 51, pp. 281-299 (1987)
  • B. Bérard, L. Thimonier : “On a concurrency measure”, Proceedings of the 2^nd Int. Symp. on Computer and Information Science, Istanbul, pp. 211-225 (1987)
• 1986
  • B. Bérard, J. Beauquier : “On the equivalence of synchronization sets”, Proceedings of CAAP'86, Nice, vol. 214, Lecture Notes in Computer Science, pp. 17-29, (Springer) (1986)
• 1985
  • B. Bérard : “Closure properties of some families of languages under literal shuffle”, Proceedings of the 4^th Hungarian Computer Science Conf., Györ, pp. 3-13 (1985)
  • B. Bérard : “Shuffle littéral, étude formelle et applications”, (1985)