B  

[Bab85]  László Babai.
Trading Group Theory for Randomness.
In STOC'85,
pages 421429.
ACM Press, May 1985.

[BAS02]  Armin Biere,
Cyrille Artho, and
Viktor Schuppan.
Liveness Checking as Safety Checking.
In FMICS'02,
Electronic Notes in Theoretical Computer Science 66(2).
Elsevier, July 2002.

[BB91]  Jos C. M. Baeten and
Jan A. Bergstra.
Real Time Process Algebra.
Formal Aspects of Computing 3(2):142188. SpringerVerlag, 1991.

[BB02]  Dietmar Berwanger and
Achim Blumensath.
The Monadic Theory of Treelike Structures.
In Erich Grädel,
Wolfgang Thomas, and
Thomas Wilke (eds.),
Automata, Logics, and Infinite Games,
Lecture Notes in Computer Science 2500, pages 285302. SpringerVerlag, 2002.

[BB04]  Laura Brandán Briones and Ed Brinksma. A Test Generation Framework for Quiescent RealTime Systems. In FATES'04, Lecture Notes in Computer Science 3395, pages 6478. SpringerVerlag, September 2004. 
[BBB+09]  Christel Baier, Nathalie Bertrand, Patricia Bouyer, and Thomas Brihaye. When are timed automata determinizable?. In ICALP'09, Lecture Notes in Computer Science 5556, pages 4354. SpringerVerlag, July 2009. 
[BBB+07]  Christel Baier,
Nathalie Bertrand,
Patricia Bouyer,
Thomas Brihaye, and
Marcus Größer.
Probabilistic and Topological Semantics for Timed
Automata.
In FSTTCS'07,
Lecture Notes in Computer Science 4855, pages 179191. SpringerVerlag, December 2007.

[BBB+08]  Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Marcus Größer. Almostsure Model Checking of Infinite Paths in Oneclock Timed Automata. In LICS'08, pages 217226. IEEE Comp. Soc. Press, June 2008. 
[BBB+07]  Éric Badouel, Marek Bednarczyk, Andrzej Borzyszkowski, Benoît Caillaud, and Philippe Darondeau. Concurrent secrets. Discrete Event Dynamic Systems 17(4):425446. Kluwer Academic, December 2007. 
[BBB+08]  Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Quantitative ModelChecking of OneClock Timed Automata under Probabilistic Semantics. In QEST'08, pages 5564. IEEE Comp. Soc. Press, September 2008. 
[BBB+14]  Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, and Marcin Jurdziński. Stochastic Timed Automata. Logical Methods in Computer Science 10(4). December 2014. 
[BBB+07]  Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, and JeanFrançois Raskin. On the Optimal Reachability Problem of Weighted Timed Automata. Formal Methods in System Design 31(2):135175. SpringerVerlag, October 2007. 
[BBC92]  Danièle Beauquier,
Jean Berstel, and
Philippe Chrétienne.
Éléments d'algorithmique.
Masson, 1992.

[BBC10]  Albert Benveniste, Anne Bouillard, and Paul Caspi. A unifying view of loosely timetriggered architectures. In EMSOFT'10, pages 189198. ACM Press, October 2010. 
[BBD14]  Thomas Brihaye,
Véronique Bruyère, and
Julie De Pril.
On Equilibria in Quantitative Games with
Reachability/Safety Objectives.
Theory of Computing Systems 54(2):150189. SpringerVerlag, February 2014.

[BBD+11]  Thomas Brihaye,
Véronique Bruyère,
Laurent Doyen,
Marc Ducobu, and
JeanFrançois Raskin.
Antichainbased QBF Solving.
In ATVA'11,
Lecture Notes in Computer Science 6996, pages 183197. SpringerVerlag, October 2011.

[BBD+12]  Thomas Brihaye,
Véronique Bruyère,
Julie De Pril, and
Hugo Gimbert.
Subgame Perfection for Equilibria in Quantitative
Reachability Games.
In FoSSaCS'12,
Lecture Notes in Computer Science 7213, pages 286300. SpringerVerlag, March 2012.

[BBD+02]  Gerd Behrmann, Johan Bengtsson, Alexandre David, Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. UPPAAL Implementation Secrets. In FTRTFT'02, Lecture Notes in Computer Science 2469, pages 322. SpringerVerlag, September 2002. 
[BBF+06]  Tomáš Brázdil,
Václav Brožek,
Vojtěch Forejt, and
Antonín Kučera.
Stochastic Games with BranchingTime Winning
Objectives.
In LICS'06,
pages 349358.
IEEE Comp. Soc. Press, July 2006.

[BBF+03]  Gerd Behrmann,
Patricia Bouyer,
Emmanuel Fleury, and
Kim Guldstrand Larsen.
Static Guard Analysis in Timed Automata
Verification.
In TACAS'03,
Lecture Notes in Computer Science 2619, pages 254270. SpringerVerlag, April 2003.

[BBF+18]  Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and PierreAlain Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. In FM'18, Lecture Notes in Computer Science 10951, pages 203221. SpringerVerlag, July 2018. 
[BBF+21]  Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and PierreAlain Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. Formal Aspects of Computing 33(1):325. SpringerVerlag, January 2021. 
[BBF+01]  Béatrice Bérard,
Michel Bidoit,
Alain Finkel,
François Laroussinie,
Antoine Petit,
Laure Petrucci,
Philippe Schnoebelen, and
Pierre McKenzie.
Systems and Software Verification: ModelChecking
Techniques and Tools.
SpringerVerlag, 2001.

[BBF+13]  Aaron Bohy,
Véronique Bruyère,
Emmanuel Filiot, and
JeanFrançois Raskin.
Synthesis from LTL Specifications with MeanPayoff
Objectives.
In TACAS'13,
Lecture Notes in Computer Science 7795, pages 169184. SpringerVerlag, March 2013.

[BBG+07]  Christel Baier,
Tomáš Brázdil,
Marcus Größer, and
Antonín Kučera.
Stochastic Game Logic.
In QEST'07,
pages 227236.
IEEE Comp. Soc. Press, September 2007.

[BBG+12]  Christel Baier, Tomáš Brázdil, Marcus Größer, and Antonín Kučera. Stochastic Game Logic. Acta Informatica 49(4):203224. SpringerVerlag, June 2012. 
[BBG+19]  Thomas Brihaye, Véronique Bruyère, Aline Goeminne, JeanFrançois Raskin, and Marie Van den Bogaard. The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. In CONCUR'19, Leibniz International Proceedings in Informatics 140, pages 13:113:16. LeibnizZentrum für Informatik, August 2019. 
[BBJ+14]  Dimitri Bohlender, Harold Bruintjes, Sebastian Junges, Jens Katelaan, Viet Yen Nguyen, and Thomas Noll. A Review of Statistical Model Checking Pitfalls on RealTime Stochastic Models. In ISoLA'14, Lecture Notes in Computer Science 8803, pages 177192. SpringerVerlag, October 2014. 
[BBL04]  Patricia Bouyer,
Ed Brinksma, and
Kim Guldstrand Larsen.
Staying Alive as Cheaply as Possible.
In HSCC'04,
Lecture Notes in Computer Science 2993, pages 203218. SpringerVerlag, March 2004.

[BBL08]  Patricia Bouyer,
Ed Brinksma, and
Kim Guldstrand Larsen.
Optimal infinite scheduling for multipriced timed
automata.
Formal Methods in System Design 32(1):223. SpringerVerlag, February 2008.

[BBL+13]  Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, and Radu Mardare. Computing Behavioral Distances, Compositionally. In MFCS'13, Lecture Notes in Computer Science 8087, pages 7485. SpringerVerlag, August 2013. 
[BBL+13]  Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, and Radu Mardare. The BisimDist Library: Efficient Computation of Bisimilarity Distances for Markovian Models. In QEST'13, pages 278281. IEEE Comp. Soc. Press, August 2013. 
[BBL+04]  Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, and Radek Pelánek. Lower and Upper Bounds in ZoneBased Abstractions of Timed Automata. In TACAS'04, Lecture Notes in Computer Science 2988, pages 312326. SpringerVerlag, March 2004. 
[BBL+06]  Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, and Radek Pelánek. Lower and Upper Bounds in ZoneBased Abstractions of Timed Automata. International Journal on Software Tools for Technology Transfer 8(3):204215. SpringerVerlag, June 2006. 
[BBL+15]  Nikola Beneš, Petr Bezdek, Kim Guldstrand Larsen, and Jiří Srba. Language Emptiness of ContinuousTime Parametric Timed Automata. In ICALP'15, Lecture Notes in Computer Science 9135, pages 6981. SpringerVerlag, July 2015. 
[BBM06]  Ramzi Ben Salah,
Marius Bozga, and
Oded Maler.
On Interleaving in Timed Automata.
In CONCUR'06,
Lecture Notes in Computer Science 4137, pages 465476. SpringerVerlag, August 2006.

[BBM06]  Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Improved Undecidability Results on Weighted Timed Automata. Information Processing Letters 98(5):188194. Elsevier, June 2006. 
[BBM10]  Patricia Bouyer, Romain Brenguier, and Nicolas Markey. Nash Equilibria for Reachability Objectives in Multiplayer Timed Games. In CONCUR'10, Lecture Notes in Computer Science 6269, pages 192206. SpringerVerlag, September 2010. 
[BBM10]  Patricia Bouyer, Romain Brenguier, and Nicolas Markey. Computing Equilibria in TwoPlayer Timed Games via TurnBased Finite Games. In FORMATS'10, Lecture Notes in Computer Science 6246, pages 6276. SpringerVerlag, September 2010. 
[BBM18]  A. R. Balasubramanian, Nathalie Bertrand, and Nicolas Markey. Parameterized verification of synchronization in constrained reconfigurable broadcast networks. In TACAS'18 (Part II), Lecture Notes in Computer Science 10806, pages 3854. SpringerVerlag, April 2018. 
[BBM+15]  Thomas Brihaye, Véronique Bruyère, Noëmie Meunier, and JeanFrançois Raskin. Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. In CSL'15, Leibniz International Proceedings in Informatics 41, pages 504518. LeibnizZentrum für Informatik, September 2015. 
[BBM+11]  Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Nash Equilibria in Concurrent Games with Büchi Objectives. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 375386. LeibnizZentrum für Informatik, December 2011. 
[BBM+12]  Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Concurrent games with ordered objectives. In FoSSaCS'12, Lecture Notes in Computer Science 7213, pages 301315. SpringerVerlag, March 2012. 
[BBM+15]  Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Pure Nash Equilibria in Concurrent Games. Logical Methods in Computer Science 11(2:9). June 2015. 
[BBR04]  Thomas Brihaye,
Véronique Bruyère, and
JeanFrançois Raskin.
Modelchecking for weighted timed automata.
In FORMATSFTRTFT'04,
Lecture Notes in Computer Science 3253, pages 277292. SpringerVerlag, September 2004.

[BBR05]  Thomas Brihaye, Véronique Bruyère, and JeanFrançois Raskin. On Optimal Timed Strategies. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 4964. SpringerVerlag, September 2005. 
[BBS01]  Jiří Barnat,
Luboš Brim, and
Jitka Stříbrná.
Distributed LTL ModelChecking in SPIN.
In SPIN'01,
Lecture Notes in Computer Science 2057, pages 200216. SpringerVerlag, May 2001.

[BC03]  Marco Benedetti and
Alessandro Cimatti.
Bounded Model Checking for Past LTL.
In TACAS'03,
Lecture Notes in Computer Science 2619, pages 1833. SpringerVerlag, April 2003.

[BC05]  Patricia Bouyer and
Fabrice Chevalier.
On Conciseness of Extensions of Timed Automata.
Journal of Automata, Languages and Combinatorics 10(4):393405. 2005.

[BC06]  Patricia Bouyer and
Fabrice Chevalier.
On the Control of Timed and Hybrid Systems.
EATCS Bulletin 89:7996. EATCS, June 2006.

[BC10]  Luboš Brim and
Jakub Chaloupka.
Using Strategy Improvement to Stay Alive.
Technical Report FIMURS201003, Faculty of Informatics, Masaryk University, Brno,
Czech Republic,
March 2010.

[BCC98]  Sergey Berezin,
Sérgio Vale Aguiar Campos, and
Edmund M. Clarke.
Compositional Reasoning in Model Checking.
In COMPOS'97,
Lecture Notes in Computer Science 1536, pages 81102. SpringerVerlag, 1998.

[BCC+03]  Armin Biere,
Alessandro Cimatti,
Edmund M. Clarke,
Ofer Strichman, and
Yunshan Zhu.
Bounded Model Checking.
In Marvin Zelkowitz (eds.),
Highly Dependable Software,
Advances in Computers 58, pages 117148. Academic Press, 2003.

[BCC+99]  Armin Biere,
Alessandro Cimatti,
Edmund M. Clarke, and
Yunshan Zhu.
Symbolic Model Checking without BDDs.
In TACAS'99,
Lecture Notes in Computer Science 1579, pages 193207. SpringerVerlag, March 1999.

[BCD05]  Patricia Bouyer, Fabrice Chevalier, and Deepak D'Souza. Fault Diagnosis Using Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 219233. SpringerVerlag, April 2005. 
[BCD+07]  Gerd Behrmann,
Agnès Cougnard,
Alexandre David,
Emmanuel Fleury,
Kim Guldstrand Larsen, and
Didier Lime.
UPPAALTiga: Time for Playing Games!.
In CAV'07,
Lecture Notes in Computer Science 4590, pages 121125. SpringerVerlag, July 2007.

[BCD+11]  Luboš Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, and JeanFrançois Raskin. Faster algorithms for meanpayoff games. Formal Methods in System Design 38(2):97118. SpringerVerlag, April 2011. 
[BCE+98]  JeanJacques Borrelly,
Ève Costemaniere,
Bernard Espiau,
Konstantinos Kapellos,
Roger PissardGibollet,
Daniel Simon, and
Nicolas Turro.
The ORCCAD Architecture.
International Journal of Robotics Research 17(4):338359. April 1998.

[BCF03]  Harry Buhrman,
Richard Chang, and
Lance Fortnow.
One Bit of Advice.
In STACS'03,
Lecture Notes in Computer Science 2607, pages 547558. SpringerVerlag, February 2003.

[BCF+04]  Patricia Bouyer,
Franck Cassez,
Emmanuel Fleury, and
Kim Guldstrand Larsen.
Optimal Strategies in Priced Timed Game Automata.
In FSTTCS'04,
Lecture Notes in Computer Science 3328, pages 148160. SpringerVerlag, December 2004.

[BCF+04]  Patricia Bouyer,
Franck Cassez,
Emmanuel Fleury, and
Kim Guldstrand Larsen.
Optimal Strategies in Priced Timed Games.
Research Report RS044, Basic Research in Computer Science, Aalborg
University, Denmark,
February 2004.

[BCG88]  Michael C. Browne,
Edmund M. Clarke, and
Orna Grumberg.
Characterizing Finite Kripke Structures in
Propositional Temporal Logic.
Theoretical Computer Science 59(12):115131. Elsevier, July 1988.

[BCG+92]  Samuel R. Buss,
Stephen A. Cook,
Vineet Gupta, and
Vijaya Ramachandran.
An Optimal Parallel Algorithm for Formula
Evaluation.
SIAM Journal on Computing 21(4):755780. Society for Industrial and Applied Math., August 1992.

[BCH+11]  Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. In LICS'11, pages 4352. IEEE Comp. Soc. Press, June 2011. 
[BCH+14]  Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. ACM Transactions on Computational Logic 15(4):27:127:25. ACM Press, August 2014. 
[BCK+01]  Luboš Brim,
Ivana Černa,
Pavel Krčál, and
Radek Pelánek.
Distributed LTL Model Checking Based on Negative
Cycle Detection.
In FSTTCS'01,
Lecture Notes in Computer Science 2245, pages 96107. SpringerVerlag, December 2001.

[BCM05]  Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. On the Expressiveness of TPTL and MTL. In FSTTCS'05, Lecture Notes in Computer Science 3821, pages 432443. SpringerVerlag, December 2005. 
[BCM10]  Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. On the Expressiveness of TPTL and MTL. Information and Computation 208(2):97116. Elsevier, February 2010. 
[BCM16]  Patricia Bouyer, Maximilien Colange, and Nicolas Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In CAV'16, Lecture Notes in Computer Science 9779, pages 513530. SpringerVerlag, July 2016. 
[BCM+92]  Jerry R. Burch,
Edmund M. Clarke,
Kenneth L. McMillan,
David L. Dill, and
L. J. Hwang.
Symbolic model checking: 1020 states and
beyond.
Information and Computation 98(2):142170. Academic Press, June 1992.

[BCO+92]  François Baccelli,
Guy Cohen,
Geert Jan Olsder, and
JeanPierre Quadrat.
Shynchronization and Linearity. An Algebra For
Discrete Event Systems.
John Wiley & Sons, 1992.

[BCZ99]  Armin Biere,
Edmund M. Clarke, and
Yunshan Zhu.
Combining Local and Global Model Checking.
In SMC'99,
Electronic Notes in Theoretical Computer Science 23(2).
Elsevier, July 1999.

[BD00]  Béatrice Bérard and
Catherine Dufourd.
Timed Automata and Additive Clock Constraints.
Information Processing Letters 75(12):17. Elsevier, July 2000.

[BDF+04]  Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, and Antoine Petit. Updatable timed Automata. Theoretical Computer Science 321(23):291345. Elsevier, August 2004. 
[BDG+17]  Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, and Hugo Gimbert. Controlling a population. In CONCUR'17, Leibniz International Proceedings in Informatics 85, pages 12:112:16. LeibnizZentrum für Informatik, September 2017. 
[BDG+11]  Thomas Brihaye,
Laurent Doyen,
Gilles Geeraerts,
Joël Ouaknine,
JeanFrançois Raskin, and
James Worrell.
On Reachability for Hybrid Automata over Bounded
Time.
In ICALP'11,
Lecture Notes in Computer Science 6756, pages 416427. SpringerVerlag, July 2011.

[BDG+98]  Béatrice Bérard,
Volker Diekert,
Paul Gastin, and
Antoine Petit.
Characterization of the Expressive Power of Silent
Transitions in Timed Automata.
Fundamenta Informaticae 36(23):145182. IOS Press, November 1998.

[BDH+06]  Dietmar Berwanger, Anuj Dawar, Paul Hunter, and Stephan Kreutzer. DAGWidth and Parity Games. In STACS'06, Lecture Notes in Computer Science 3884, pages 524536. SpringerVerlag, February 2006. 
[BDJ+16]  Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey, and Jiří Srba (eds.) 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). Electronic Proceedings in Theoretical Computer Science 220. July 2016. 
[BDL12]  Benedikt Bollig, Normann Decker, and Martin Leucker. Frequency Lineartime Temporal Logic. In TASE'12, pages 8592. IEEE Comp. Soc. Press, July 2012. 
[BDL+06]  Gerd Behrmann, Alexandre David, Kim Guldstrand Larsen, John Håkansson, Paul Pettersson, Wang Yi, and Martijn Hendriks. UPPAAL 4.0. In QEST'06, pages 125126. IEEE Comp. Soc. Press, September 2006. 
[BDL+14]  Peter Bulychev, Alexandre David, Kim Guldstrand Larsen, and Guangyuan Li. Efficient Controller Synthesis for a fragment of MTL0,&infin. Acta Informatica 51(34):165192. SpringerVerlag, June 2014. 
[BDL+12]  Peter Bulychev, Alexandre David, Kim Guldstrand Larsen, Axel Legay, Guangyuan Li, Danny Bøgsted Poulsen, and Amélie Stainer. Monitorbased statistical model checking for weighted metric temporal logic. In LPAR'12, Lecture Notes in Computer Science 7180, pages 168182. SpringerVerlag, March 2012. 
[BDL+12]  Peter Bulychev,
Alexandre David,
Kim Guldstrand Larsen,
Axel Legay,
Marius Mikučionis, and
Danny Bøgsted Poulsen.
Checking and Distributing Statistical Model
Checking.
In NFM'12,
Lecture Notes in Computer Science 7226, pages 449463. SpringerVerlag, April 2012.

[BDL+09]  Thomas Brihaye, Arnaud Da Costa, François Laroussinie, and Nicolas Markey. ATL with Strategy Contexts and Bounded Memory. In LFCS'09, Lecture Notes in Computer Science 5407, pages 92106. SpringerVerlag, January 2009. 
[BDL+97]  Joshua Berman,
Arthur Drisko,
François Lemieux,
Cristopher Moore, and
Denis Thérien.
Circuit and Expressions with NonAssociative Gates.
In CoCo'97,
pages 193203.
IEEE Comp. Soc. Press, June 1997.

[BDL+11]  Gerd Behrmann,
Alexandre David,
Kim Guldstrand Larsen,
Paul Pettersson, and
Wang Yi.
Developing UPPAAL over 15 years.
Software – Practice and Experience 41(2):133142. IEEE Comp. Soc. Press, February 2011.

[BDM+03]  Patricia Bouyer,
Deepak D'Souza,
Parthasarathy Madhusudan, and
Antoine Petit.
Timed Control with Partial Observability.
In CAV'03,
Lecture Notes in Computer Science 2725, pages 180192. SpringerVerlag, July 2003.

[BDM+09]  Patricia Bouyer, Marie Duflot, Nicolas Markey, and Gabriel Renault. Measuring Permissivity in Finite Games. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 196210. SpringerVerlag, September 2009. 
[BDR03]  Véronique Bruyère,
Emmanuel Dall'Olio, and
JeanFrançois Raskin.
Durations, Parametric Model Checking in Timed
Automata with Presburger Arithmetic.
In STACS'03,
Lecture Notes in Computer Science 2607, pages 687698. SpringerVerlag, February 2003.

[BDS+09]  Hans Bherer, Jules Desharnais, and Richard StDenis. Control of Parameterized Discrete Event Systems. Discrete Event Dynamic Systems 19(2):213165. Kluwer Academic, June 2009. 
[Bea03]  Danièle Beauquier. On probabilistic timed automata. Theoretical Computer Science 292(1):6584. Elsevier, January 2003. 
[Bed01]  Nicolas Bedon.
Logic over Words on Denumerable Ordinals.
Journal of Computer and System Sciences 63(3):394431. Academic Press, November 2001.

[BEG+15]  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino. Markov Decision Processes and Stochastic Games with Total Effective Payoff. In STACS'15, Leibniz International Proceedings in Informatics 30, pages 103115. LeibnizZentrum für Informatik, March 2015. 
[Bei91]  Richard Beigel.
Bounded Queries to SAT and the Boolean
Hierarchy.
Theoretical Computer Science 84(2):199223. Elsevier, 1991.

[BEK18]  Michael Blondin, Javier Esparza, and Antonín Kučera. Automatic Analysis of Expected Termination Time for Population Protocols. In CONCUR'18, Leibniz International Proceedings in Informatics 118, pages 33:133:16. LeibnizZentrum für Informatik, September 2018. 
[Bel57]  Richard Bellman.
Dynamic Programming.
Princeton University Press, 1957.

[Bel58]  Richard Bellman.
On a Routing Problem.
Quarterly of Applied Mathematics 16(1):8790. 1958.

[Bel06]  Houda Bel Mokadem.
Vérification des propriétés
temporisées des automates programmables
industriels.
Thèse de doctorat,
Lab. Spécification & Vérification, ENS Cachan,
France,
September 2006.

[BEM96]  Julian C. Bradfield,
Javier Esparza, and
Angelika Mader.
An effective tableau system for the linear time
mucalculus.
In ICALP'96,
Lecture Notes in Computer Science 1099, pages 98109. SpringerVerlag, July 1996.

[Ber00]  Gérard Berry.
The foundations of Esterel.
In Gordon D. Plotkin,
Colin Stirling, and
Mads Tofte (eds.),
Proof, Language, and Interaction – Essays in Honour
of Robin Milner.
MIT Press, 2000.

[Bey01]  Dirk Beyer.
Rabbit: Verification of RealTime Systems.
In RTTOOLS'01,
pages 1321.
August 2001.

[BF09]  Patricia Bouyer and
Vojtěch Forejt.
Reachability in Stochastic Timed Games.
In ICALP'09,
Lecture Notes in Computer Science 5556, pages 103114. SpringerVerlag, July 2009.

[BFA15]  Umang Bhaskar, Lisa Fleischer, and Elliot Anshelevich. A Stackelberg strategy for routing flow over time. Games and Economic Behavior 92:232247. July 2015. 
[BFD02]  Alexander Bolotov,
Michael J. Fischer, and
Clare Dixon.
On the Relationship between ωAutomata
and Temporal Logic Normal Forms.
Journal of Logic and Computation 12(4):561581. Oxford University Press, August 2002.

[BFF+20]  Raphaël Berthon,
Nathanaël Fijalkow,
Emmanuel Filiot,
Shibashis Guha,
Bastien Maubert,
Aniello Murano,
Laureline Pinault,
Sophie Pinchinat,
Sasha Rubin, and
Olivier Serre.
Alternating Tree Automata with Qualitative
Semantics.
Technical Report 200203664, arXiv,
February 2020.

[BFF+21]  Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, and Olivier Serre. Alternating Tree Automata with Qualitative Semantics. ACM Transactions on Computational Logic 22(1):7:17:24. ACM Press, January 2021. 
[BFF+11]  Vittorio Bilò, Angelo Fanelli, Michele Flammini, and Luca Moscardelli. Graphical congestion games. Algorithmica 61(2):274297. SpringerVerlag, October 2011. 
[BFH09]  Felix Brandt,
Felix Fischer, and
Markus Holzer.
Symmetries and the complexity of pure Nash
equilibrium.
Journal of Computer and System Sciences 75(3):163177. Elsevier, May 2009.

[BFH+03]  Albert Benveniste, Éric Fabre, Stefan Haar, and Claude Jard. Diagnosis of asynchronous discrete event systems: A netunfolding approach. IEEE Transactions on Automatic Control 48(5):714727. IEEE Comp. Soc. Press, 2003. 
[BFH+01]  Gerd Behrmann,
Ansgar Fehnker,
Thomas Hune,
Kim Guldstrand Larsen,
Paul Pettersson, and
Judi Romijn.
Efficient Guiding Towards CostOptimality in UPPAAL.
In TACAS'01,
Lecture Notes in Computer Science 2031, pages 174188. SpringerVerlag, April 2001.

[BFH+01]  Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Guldstrand Larsen, Paul Pettersson, Judi Romijn, and Frits Vaandrager. MinimumCost Reachability for Priced Timed Automata. In HSCC'01, Lecture Notes in Computer Science 2034, pages 147161. SpringerVerlag, March 2001. 
[BFL+10]  Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, and Nicolas Markey. Timed Automata with Observers under Energy Constraints. In HSCC'10, pages 6170. ACM Press, April 2010. 
[BFL+11]  Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, and Nicolas Markey. Quantitative analysis of realtime systems using priced timed automata. Communications of the ACM 54(9):7887. ACM Press, September 2011. 
[BFL+18]  Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, and James Worrell. Model Checking RealTime Systems. In Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (eds.), Handbook of Model Checking. SpringerVerlag, May 2018. 
[BFL+08]  Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and Jiří Srba. Infinite Runs in Weighted Timed Automata with Energy Constraints. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 3347. SpringerVerlag, September 2008. 
[BFM15]  Patricia Bouyer, Erwin Fang, and Nicolas Markey. Permissive strategies in timed automata and games. In AVOCS'15, Electronic Communications of the EASST 72. European Association of Software Science and Technology, September 2015. 
[BFP+73]  Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest, and
Robert Endre Tarjan.
Time Bounds for Selection.
Journal of Computer and System Sciences 7(4):448461. Academic Press, August 1973.

[BFS14]  Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier. Playing with Probabilities in Reconfigurable Broadcast Networks. In FoSSaCS'14, Lecture Notes in Computer Science 8412, pages 134148. SpringerVerlag, April 2014. 
[BFS15]  Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier. Distributed Local Strategies in Broadcast Networks. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 4457. LeibnizZentrum für Informatik, September 2015. 
[BG85]  John P. Burgess and
Yuri Gurevich.
The Decision Problem for Linear Temporal Logic.
Notre Dame Journal of Formal Logic 26(2):115128. April 1985.

[BG93]  Orna Bernholtz and
Orna Grumberg.
Branching Time Temporal Logic and A
m o r p H
O u s Tree Automata.
In CONCUR'93,
Lecture Notes in Computer Science 715, pages 262277. SpringerVerlag, August 1993.

[BG99]  Glenn Bruns and
Patrice Godefroid.
Model Checking Partial State Spaces with
3Valued Temporal Logics.
In CAV'99,
Lecture Notes in Computer Science 1633, pages 274287. SpringerVerlag, July 1999.

[BG01]  Glenn Bruns and
Patrice Godefroid.
Temporal Logic Query Checking (Extended Abstract).
In LICS'01,
pages 409417.
IEEE Comp. Soc. Press, June 2001.

[BG02]  Robert Baumgartner and
Georg Gottlob.
Propositional Default Logics made Easier:
Computational Complexity of Model Checking.
Theoretical Computer Science 289(1):591627. Elsevier, October 2002.

[BG03]  Régis Barbanchon and
Étienne Grandjean.
The Minimal LogicallyDefined NPComplete Problem.
In STACS'04,
Lecture Notes in Computer Science 2996, pages 338349. SpringerVerlag, March 2003.

[BG04]  Dietmar Berwanger and Erich Grädel. FixedPoint Logics and Solitaire Games. Theory of Computing Systems 37(6):675694. SpringerVerlag, December 2004. 
[BG05]  Dietmar Berwanger and
Erich Grädel.
Entanglement – A Measure for the Complexity of
Directed Graphs with Applications to Logic and
Games.
In LPAR'04,
Lecture Notes in Computer Science 3452, pages 209223. SpringerVerlag, March 2005.

[BG11]  Nathalie Bertrand and Blaise Genest. Minimal Disclosure in Partially Observable Markov Decision Processes. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 411422. LeibnizZentrum für Informatik, December 2011. 
[BG13]  Nils Bulling and Valentin Goranko. How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about MultiPlayer Games (Extended Abstract). In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 3341. March 2013. 
[BGG17]  Nathalie Bertrand, Blaise Genest, and Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals. Journal of the ACM 64(5):33:133:48. ACM Press, October 2017. 
[BGH13]  Olivier Bournez,
Daniel S. Graça, and
Emmanuel Hainry.
Computation with perturbed dynamical systems.
Journal of Computer and System Sciences 79(5):714724. Elsevier, August 2013.

[BGH+09]  Roderick Bloem,
Karin Greimel,
Thomas A. Henzinger, and
Barbara Jobstmann.
Synthesizing robust systems.
In FMCAD'09,
pages 8592.
IEEE Comp. Soc. Press, November 2009.

[BGH+15]  Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege. Simple priced timed games are not that simple. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 278292. LeibnizZentrum für Informatik, December 2015. 
[BGH+17]  Thomas Brihaye, Gilles Geeraerts, Axel Haddad, and Benjamin Monmege. Pseudopolynomial iterative algorithm to solve totalpayoff games and mincost reachability game. Acta Informatica 54(1):85125. SpringerVerlag, February 2017. 
[BGI+01]  Boaz Barak,
Oded Goldreich,
Rusell Impagliazzo,
Steven Rudich,
Amit Sahai,
Salil Vadhan, and
Ke Yang.
On the (Im)possibility of Obfuscating Programs.
In CRYPTO'01,
Lecture Notes in Computer Science 2139, pages 118. SpringerVerlag, August 2001.

[BGI+01]  Boaz Barak,
Oded Goldreich,
Rusell Impagliazzo,
Steven Rudich,
Amit Sahai,
Salil Vadhan, and
Ke Yang.
On the (Im)possibility of Obfuscating Programs.
Research Report 01057, Electronic Colloquium on Computational Complexity,
August 2001.

[BGK+96]  Johan Bengtsson,
W. O. David Griffioen,
Kåre J. Kristoffersen,
Kim Guldstrand Larsen,
Fredrik Larsson,
Paul Pettersson, and
Wang Yi.
Verification of an Audio Protocol with Bus Collision
Using Uppaal.
In CAV'96,
Lecture Notes in Computer Science 1102, pages 244256. SpringerVerlag, July 1996.

[BGM14]  Patricia Bouyer, Patrick Gardy, and Nicolas Markey. Quantitative verification of weighted Kripke structures. In ATVA'14, Lecture Notes in Computer Science 8837, pages 6480. SpringerVerlag, November 2014. 
[BGM15]  Patricia Bouyer, Patrick Gardy, and Nicolas Markey. Weighted strategy logic with boolean goals over onecounter games. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 6983. LeibnizZentrum für Informatik, December 2015. 
[BGM16]  Patricia Bouyer, Patrick Gardy, and Nicolas Markey. On the semantics of Strategy Logic. Information Processing Letters 116(2):7579. Elsevier, February 2016. 
[BGM+08]  Thomas Brihaye, Mohamed Ghannem, Nicolas Markey, and Lionel Rieg. Good friends are hard to find!. In TIME'08, pages 3240. IEEE Comp. Soc. Press, June 2008. 
[BGM+18]  Damien BusattoGaston, Benjamin Monmege, and PierreAlain Reynier. Symbolic Approximation of Weighted Timed Games. In FSTTCS'18, Leibniz International Proceedings in Informatics 122, pages 28:128:16. LeibnizZentrum für Informatik, December 2018. 
[BGM+18]  Patricia Bouyer, Mauricio González, Nicolas Markey, and Mickael Randour. Multiweighted Markov Decision Processes with Reachability Objectives. In GandALF'18, Electronic Proceedings in Theoretical Computer Science 277, pages 250264. September 2018. 
[BGM+19]  Damien BusattoGaston, Benjamin Monmege, PierreAlain Reynier, and Ocan Sankur. Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. In CAV'19, Lecture Notes in Computer Science 11561, pages 572590. SpringerVerlag, July 2019. 
[BGN+14]  Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, and Ashutosh Trivedi. Adding negative prices to priced timed games. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 560575. SpringerVerlag, September 2014. 
[BGP96]  Béatrice Bérard,
Paul Gastin, and
Antoine Petit.
Timed Automata with non Observable Actions:
Expressive power and refinement.
In STACS'96,
Lecture Notes in Computer Science 1046, pages 257268. SpringerVerlag, February 1996.

[BGS92]  José Balcázar,
Joaquim Gabarró, and
Miklós Sántha.
Deciding bisimilarity is Pcomplete.
Formal Aspects of Computing 4(1 supplement):638648. SpringerVerlag, November 1992.

[BGS14]  Benedikt Bollig, Paul Gastin, and Jana Schubert. Parameterized verification of communicating automata under context bounds. In RP'14, Lecture Notes in Computer Science 8762, pages 4557. SpringerVerlag, September 2014. 
[BGW01]  Nikita Borisov,
Ian Goldberg, and
Klaus W. Wagner.
Intercepting Mobile Communications: The Insecurity
of 802.11.
In MOBICOM'01,
pages 180189.
ACM Press, July 2001.

[BH67]  Manuel Blum and
Carl Hewitt.
Automata on a 2Dimensional Tape.
In FOCS'67,
pages 155160.
IEEE Comp. Soc. Press, October 1967.

[BH81]  Arthur J. Bernstein and
Jr. Harter.
Proving RealTime Properties of Programs with
Temporal Logic.
In SOSP'81,
Operating System Review 15(5), pages 111. ACM Press, December 1981.

[BH04]  Anne Bergeron and
Sylvie Hamel.
From Cascade Decompositions to BitVector
Algotithms.
Theoretical Computer Science 313(1):316. Elsevier, February 2004.

[BH05]  Dragan Bosnacki and Gerard J. Holzmann. Improving Spin's PartialOrder Reduction for BreadthFirst Search. In SPIN'05, Lecture Notes in Computer Science 3639, pages 91105. SpringerVerlag, April 2005. 
[BH06]  Bernard Boigelot and Frédéric Herbreteau. The Power of Hybrid Acceleration. In CAV'06, Lecture Notes in Computer Science 4144, pages 438451. SpringerVerlag, July 2006. 
[Bhe09]  Hans Bherer.
Controller Synthesis for Parameterized Discrete
Event Systems.
PhD thesis,
Université Laval, Québec, Canada,
2009.

[BHJ03]  Bernard Boigelot, Frédéric Herbreteau, and Sébastien Jodogne. Hybrid Acceleration using Real Vector Automata (extended abstract). In CAV'03, Lecture Notes in Computer Science 2725, pages 193205. SpringerVerlag, July 2003. 
[BHJ03]  Bernard Boigelot,
Frédéric Herbreteau, and
Sébastien Jodogne.
Hybrid Acceleration using Real Vector Automata.
Technical Report 2003.18, Centre Fédéré en Vérification, Bruxelles,
Belgium,
2003.

[BHJ+21]  Patricia Bouyer, Léo Henry, Samy Jaziri, Thierry Jéron, and Nicolas Markey. Diagnosing timed automata using timed markings. International Journal on Software Tools for Technology Transfer 23(2):229253. SpringerVerlag, April 2021. 
[BHK00]  Steven Bradley,
William Henderson, and
David Kendall.
Using Timed Automata for Response Time Analysis and
Distributer RealTime Systems.
In WRTP'99,
pages 143148.
Pergamon Press, January 2000.

[BHL14]  Nathalie Bertrand, Serge Haddad, and Engel Lefaucheux. Foundation of Diagnosis and Predictability in Probabilistic Systems. In FSTTCS'14, Leibniz International Proceedings in Informatics 29, pages 417429. LeibnizZentrum für Informatik, December 2014. 
[BHM08]  Aske Wiid Brekling,
Michael R. Hansen, and
Jan Madsen.
Models and formal verification of multiprocessor
systemonchips.
Journal of Logic and Algebraic Programming 77(12):119. Elsevier, October 2008.

[BHM14]  Bernard Boigelot, Frédéric Herbreteau, and Isabelle Mainz. Acceleration of Affine Hybrid Transformations. In ATVA'14, Lecture Notes in Computer Science 8837, pages 3146. SpringerVerlag, November 2014. 
[BHM17]  Béatrice Bérard,
Loïc Hélouët, and
John Mullins.
Noninterference in partial order models.
ACM Transactions on Embedded Computing Systems.
ACM Press, 2017. To appear.

[BHM+17]  Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, and Martin Zimmermann. Bounding Averageenergy Games. In FoSSaCS'17, Lecture Notes in Computer Science 10203, pages 179195. SpringerVerlag, April 2017. 
[BHP+07]  Thomas Brihaye,
Thomas A. Henzinger,
Vinayak S. Prabhu, and
JeanFrançois Raskin.
MinimumTime Reachability in Timed Games.
In ICALP'07,
Lecture Notes in Computer Science 4596, pages 825837. SpringerVerlag, July 2007.

[BHR06]  Patricia Bouyer, Serge Haddad, and PierreAlain Reynier. Timed Unfoldings for Networks of Timed Automata. In ATVA'06, Lecture Notes in Computer Science 4218, pages 292306. SpringerVerlag, October 2006. 
[BHR09]  Patricia Bouyer,
Serge Haddad, and
PierreAlain Reynier.
Undecidability Results for Timed Automata with
Silent Transitions.
Fundamenta Informaticae 92(12):125. IOS Press, 2009.

[BHR+02]  Danièle Beauquier,
Yoram Hirshfeld,
Alexander Rabinovich, and
Anatol Slissenko.
The Probablity Nesting Game.
In EXPRESS'02,
Electronic Notes in Theoretical Computer Science 68(2), pages 313. Elsevier, August 2002.

[BHT07]  Dirk Beyer, Thomas A. Henzinger, and Grégory Théoduloz. Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis. In CAV'07, Lecture Notes in Computer Science 4590. SpringerVerlag, July 2007. 
[BIL06]  Marius Bozga,
Radu Iosif, and
Yassine Lakhnech.
Flat Parametric Counter Automata.
Research Report TR200515, Lab. VERIMAG, Grenoble, France,
March 2006.

[BIL06]  Marius Bozga, Radu Iosif, and Yassine Lakhnech. Flat Parametric Counter Automata. In ICALP'06, Lecture Notes in Computer Science 4052, pages 577588. SpringerVerlag, July 2006. 
[BIS90]  David A. Mix Barrington,
Neil Immerman, and
Howard Straubing.
On Uniformity Within NC1.
Journal of Computer and System Sciences 41(3):274306. Academic Press, December 1990.

[BJ10]  Nils Bulling and
Wojciech Jamroga.
Model Checking Agents with Memory Is Harder than It
Seemed.
In AAMAS'10,
pages 633640.
International Foundation for Autonomous Agents and
Multiagent Systems, May 2010.

[BJK10]  Tomáš Brázdil, Petr Jančar, and Antonín Kučera. Reachability Games on Extended Vector Addition Systems with States. In ICALP'10, Lecture Notes in Computer Science 6199, pages 478489. SpringerVerlag, July 2010. 
[BJK+05]  Manfred Broy,
Bengt Jonsson,
JoostPieter Katoen,
Martin Leucker, and
Alexander Pretschner.
ModelBased Testing of Reactive Systems – Advanced
lectures.
Lecture Notes in Computer Science 3472.
SpringerVerlag, 2005.

[BJL+10]  Thomas Brihaye, Marc Jungers, Samson Lasaulce, Nicolas Markey, and Ghassan Oreiby. Using Model Checking for Analyzing Distributed Power Control Problems. EURASIP Journal on Wireless Communications and Networking 2010(861472). Hindawi Publishing Corp., June 2010. 
[BJL+98]  Johan Bengtsson, Bengt Jonsson, Johan Lilius, and Wang Yi. PartialOrder Reductions for Timed Systems. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 485500. SpringerVerlag, September 1998. 
[BJM15]  Patricia Bouyer, Samy Jaziri, and Nicolas Markey. On the Value Problem in Weighted Timed Games. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 311324. LeibnizZentrum für Informatik, September 2015. 
[BJM17]  Patricia Bouyer, Samy Jaziri, and Nicolas Markey. On the determinization of timed systems. In FORMATS'17, Lecture Notes in Computer Science 10419, pages 2541. SpringerVerlag, September 2017. 
[BJM17]  Patricia Bouyer,
Vincent Jugé, and
Nicolas Markey.
Courcelle's Theorem Made Dynamic.
Technical Report 1702.05183, arXiv,
February 2017.

[BJM18]  Patricia Bouyer, Samy Jaziri, and Nicolas Markey. Efficient timed diagnosis using automata with timed domains. In RV'18, Lecture Notes in Computer Science 11237, pages 205221. SpringerVerlag, November 2018. 
[BJM+02]  Marius Bozga,
Hou Jianmin,
Oded Maler, and
Sergio Yovine.
Verification of Asynchronous Circuits using Timed
Automata.
In TPTS'02,
Electronic Notes in Theoretical Computer Science 65(6), pages 4759. Elsevier, April 2002.

[BJS09]  Joakim Byg, Kenneth Yrke Jørgensen, and Jiří Srba. TAPAAL: Editor, Simulator and Verifier of TimedArc Petri Nets. In ATVA'09, Lecture Notes in Computer Science 5799, pages 8489. SpringerVerlag, October 2009. 
[BJS+12]  Nathalie Bertrand, Thierry Jéron, Amélie Stainer, and Moez Krichen. Offline test selection with test purposes for nondeterministic timed automata. Logical Methods in Computer Science 8(4). 2012. 
[BJV10]  Jasper Berendsen,
David N. Jansen, and
Frits Vaandrager.
Fortuna: model checking priced probabilistic timed
automata.
In QEST'10,
pages 273281.
IEEE Comp. Soc. Press, September 2010.

[BJW02]  Julien Bernet,
David Janin, and
Igor Walukiewicz.
Permissive strategies: from parity games to safety
games.
RAIRO – Theoretical Informatics and Applications 36(3):261275. EDP Sciences, 2002.

[BK08]  Christel Baier and
JoostPieter Katoen.
Principles of ModelChecking.
MIT Press, May 2008.

[BKK11]  Christel Baier,
Joachim Klein, and
Sascha Klüppelholz.
A Compositional Framework for Controller Synthesis.
In CONCUR'11,
Lecture Notes in Computer Science 6901, pages 512527. SpringerVerlag, September 2011.

[BKK+14]  Tomáš Brázdil,
David Klaška,
Antonín Kučera, and
Petr Novotný.
Minimizing Running Costs in Consumption Systems.
In CAV'14,
Lecture Notes in Computer Science 8559, pages 457472. SpringerVerlag, July 2014.

[BKM+19]  Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, and Giuseppe Perelli. Reasoning about Quality and Fuzziness of Strategic Behaviours. In IJCAI'19, pages 15881594. IJCAI organization, August 2019. 
[BKM+06]  Jeremy W. Bryans, Maciej Koutny, Laurent Mazaré, and Peter Y. A. Ryan. Opacity generalised to transition systems. In FAST'05, Lecture Notes in Computer Science 3866, pages 8195. SpringerVerlag, 2006. 
[BKO+08]  Thomas Bøgholm, Henrik Karghhansen, Petur Olsen, Bent Thomsen, and Kim Guldstrand Larsen. Modelbased schedulability analysis of safety critical hard realtime Java programs. In JTRES'08, ACM International Conference Proceeding Series 343, pages 106114. ACM Press, September 2008. 
[BKP86]  Howard Barringer,
Ruurd Kuiper, and
Amir Pnueli.
A Really Abstract Concurrent Model and its Temporal
Logic.
In POPL'86,
pages 173183.
ACM Press, January 1986.

[BKP11]  Dietmar Berwanger,
łukasz Kaiser, and
Bernd Puchala.
A PerfectInformation Construction for Coordination
in Games.
In FSTTCS'11,
Leibniz International Proceedings in Informatics 13, pages 387398. LeibnizZentrum für Informatik, December 2011.

[BL69]  Julius R. Büchi and
Lawrence H. Landweber.
Solving Sequential Conditions by FiniteState
Strategies.
Transactions of the American Mathematical Society 138:295311. American Mathematical Society, April 1969.

[BL95]  Ahmed Bouajjani and
Yassine Lakhnech.
Temporal Logic + Timed Automata: Expressiveness and
Decidability.
In CONCUR'95,
Lecture Notes in Computer Science 962, pages 531545. SpringerVerlag, August 1995.

[BL12]  Mikołaj Bojańczyk and Sławomir Lasota. A MachineIndependent Characterization of Timed Languages. In ICALP'12, Lecture Notes in Computer Science 7392, pages 92103. SpringerVerlag, July 2012. 
[Bla00]  Patrick Blackburn.
Representations, Reasoning and Relational
Structures: a Hybrid Logic Manifesto.
Logic Journal of the IGPL 8(3):339365. Oxford University Press, May 2000.

[BLM07]  Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. Model Checking Oneclock Priced Timed Automata. In FoSSaCS'07, Lecture Notes in Computer Science 4423, pages 108122. SpringerVerlag, March 2007. 
[BLM08]  Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. Model Checking Oneclock Priced Timed Automata. Logical Methods in Computer Science 4(2). May 2008. 
[BLM12]  Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. LowerBound Constrained Runs in Weighted Timed Automata. In QEST'12, pages 128137. IEEE Comp. Soc. Press, September 2012. 
[BLM14]  Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. LowerBound Constrained Runs in Weighted Timed Automata. Performance Evaluation 73:91109. Elsevier, March 2014. 
[BLM+07]  Thomas Brihaye, François Laroussinie, Nicolas Markey, and Ghassan Oreiby. Timed Concurrent Game Structures. In CONCUR'07, Lecture Notes in Computer Science 4703, pages 445459. SpringerVerlag, September 2007. 
[BLM+17]  Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, and James Worrell. Timed temporal logics. In Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare (eds.), Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 10460, pages 211230. SpringerVerlag, August 2017. 
[BLM+06]  Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, and Jacob Illum Rasmussen. Almost Optimal Strategies in OneClock Priced Timed Automata. In FSTTCS'06, Lecture Notes in Computer Science 4337, pages 345356. SpringerVerlag, December 2006. 
[BLM+97]  David A. Mix Barrington,
ChiJen Lu,
Peter Bro Miltersen, and
Sven Skyum.
On Uniformity Within NC1.
Research Report 97044, Electronic Colloquium on Computational Complexity,
September 1997.

[BLM+11]  Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Ocan Sankur, and Claus Thrane. Timed automata can always be made implementable. In CONCUR'11, Lecture Notes in Computer Science 6901, pages 7691. SpringerVerlag, September 2011. 
[BLN03]  Dirk Beyer, Claus Lewerentz, and Andreas Noack. Rabbit: A Tool for BDDBased Verification of RealTime Systems. In CAV'03, Lecture Notes in Computer Science 2725, pages 122125. SpringerVerlag, July 2003. 
[Blo93]  Johannes Blömer.
Computing Sums of Radicals in Polynomial Time.
Technical Report B9313, Department of Computer Science, University of
Paderborn, Germany,
August 1993.

[BLP03]  Gerd Behrmann,
Kim Guldstrand Larsen, and
Radek Pelánek.
To Store or not to Store.
In CAV'03,
Lecture Notes in Computer Science 2725, pages 433445. SpringerVerlag, July 2003.

[BLP+98]  Gerd Behrmann,
Kim Guldstrand Larsen,
Justin Pearson,
Carsten Weise, and
Wang Yi.
Efficient Timed Reachability Analysis using Clock
Difference Diagrams.
Research Report RS9847, Basic Research in Computer Science, Aalborg
University, Denmark,
December 1998.

[BLP+99]  Gerd Behrmann,
Kim Guldstrand Larsen,
Justin Pearson,
Carsten Weise, and
Wang Yi.
Efficient Timed Reachability Analysis using Clock
Difference Diagrams.
In CAV'99,
Lecture Notes in Computer Science 1633, pages 341353. SpringerVerlag, July 1999.

[BLR05]  Patricia Bouyer, François Laroussinie, and PierreAlain Reynier. Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 112126. SpringerVerlag, September 2005. 
[BLR05]  Gerd Behrmann,
Kim Guldstrand Larsen, and
Jacob Illum Rasmussen.
Optimal scheduling using priced timed automata.
SIGMETRICS Performance Evaluation Review 32(4):3440. March 2005.

[BLS22]  Udi Boker, Karoliina Lehtinen, and Salomon Sickert. On the Translation of Automata to Linear Temporal Logic. In FoSSaCS'22, Lecture Notes in Computer Science 13242, pages 140160. SpringerVerlag, April 2022. 
[BLW01]  Benedikt Bollig,
Martin Leucker, and
Michael Weber.
Local Parallel Model Checking for the Alternation
Free μCalculus.
Technical Report AIB200104, Aachener Informatik Berichte, Aachen, Germany,
March 2001.

[BM83]  Bernard Berthomieu and
Miguel Menasche.
An Enumerative Approach for Analyzing Time Petri
Nets.
In WCC'83,
pages 4146.
NorthHolland/IFIP, September 1983.

[BM95]  Michael S. Branicky and
Sanjoy K. Mitter.
Algorithms for Optimal Hybrid Control.
In CDC'95,
pages 26612666.
IEEE Comp. Soc. Press, December 1995.

[BM00]  Ed Brinksma and
Angelika Mader.
Verification and Optimization of a PLC Control
Schedule.
In SPIN'00,
Lecture Notes in Computer Science 1885, pages 7392. SpringerVerlag, August 2000.

[BM07]  Patricia Bouyer and Nicolas Markey. Costs are Expensive!. In FORMATS'07, Lecture Notes in Computer Science 4763, pages 5368. SpringerVerlag, October 2007. 
[BMF02]  Ed Brinksma,
Angelika Mader, and
Ansgar Fehnker.
Verification and Optimization of a PLC Control
Schedule.
International Journal on Software Tools for
Technology Transfer 4(1):2133. SpringerVerlag, 2002.

[BMM14]  Patricia Bouyer, Nicolas Markey, and Raj Mohan Matteplackel. Averaging in LTL. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 266280. SpringerVerlag, September 2014. 
[BMM17]  Raphaël Berthon,
Bastien Maubert, and
Aniello Murano.
Decidability Results for ATL*
with Imperfect Information and Perfect Recall.
In AAMAS'17,
pages 12501258.
International Foundation for Autonomous Agents and
Multiagent Systems, May 2017.

[BMM+17]  Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, and Moshe Y. Vardi. Strategy Logic with Imperfect Information. In LICS'17, pages 112. IEEE Comp. Soc. Press, June 2017. 
[BMM+00]  JeanCamille Birget,
Stuart W. Margolis,
John C. Meakin, and
Pascal Weil.
PSPACECompleteness of Certain Algorithmic
Problems on the Subgroups of Free Groups.
Theoretical Computer Science 242(12):247281. Elsevier, July 2000.

[BMO+08]  Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, and James Worrell. On Termination for Faulty Channel Machines. In STACS'08, Leibniz International Proceedings in Informatics 1, pages 121132. LeibnizZentrum für Informatik, February 2008. 
[BMO+12]  Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, and James Worrell. On Termination and Invariance for Faulty Channel Systems. Formal Aspects of Computing 24(46):595607. SpringerVerlag, July 2012. 
[BMO+11]  Patricia Bouyer, Nicolas Markey, Jörg Olschewski, and Michael Ummels. Measuring Permissiveness in Parity Games: MeanPayoff Parity Games Revisited. In ATVA'11, Lecture Notes in Computer Science 6996, pages 135149. SpringerVerlag, October 2011. 
[BMO+07]  Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell. The Cost of Punctuality. In LICS'07, pages 109118. IEEE Comp. Soc. Press, July 2007. 
[BMO+08]  Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell. On Expressiveness and Complexity in Realtime Model Checking. In ICALP'08, Lecture Notes in Computer Science 5126, pages 124135. SpringerVerlag, July 2008. 
[BMP10]  Laura Bozzelli,
Aniello Murano, and
Adriano Peron.
Pushdown module checking.
Formal Methods in System Design 36(1):6595. SpringerVerlag, February 2010.

[BMP+15]  Patricia Bouyer, Nicolas Markey, Nicolas Perrin, and Philipp SchlehuberCaissier. Timed automata abstraction of switched dynamical systems using control funnels. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 6075. SpringerVerlag, September 2015. 
[BMP+17]  Patricia Bouyer, Nicolas Markey, Nicolas Perrin, and Philipp SchlehuberCaissier. Timed automata abstraction of switched dynamical systems using control funnels. RealTime Systems 53(3):327353. Kluwer Academic, May 2017. 
[BMP+97]  Martin Beaudry,
Pierre McKenzie,
Pierre Péladeau, and
Denis Thérien.
Finite Monoids: From Word to Circuit Evaluation.
SIAM Journal on Computing 26(1):138152. Society for Industrial and Applied Math., February 1997.

[BMR06]  Patricia Bouyer, Nicolas Markey, and PierreAlain Reynier. Robust ModelChecking of LinearTime Properties in Timed Automata. In LATIN'06, Lecture Notes in Computer Science 3887, pages 238249. SpringerVerlag, March 2006. 
[BMR08]  Patricia Bouyer, Nicolas Markey, and PierreAlain Reynier. Robust Analysis of Timed Automata via Channel Machines. In FoSSaCS'08, Lecture Notes in Computer Science 4962, pages 157171. SpringerVerlag, March 2008. 
[BMR14]  Véronique Bruyère, Noëmie Meunier, and JeanFrançois Raskin. Secure Equilibria in Weighted Games. In CSL/ LICS'14. ACM Press, July 2014. 
[BMR+15]  Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, and Simon Laursen. Averageenergy games. In GandALF'15, Electronic Proceedings in Theoretical Computer Science 193, pages 115. September 2015. 
[BMR+18]  Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, and Simon Laursen. Averageenergy games. Acta Informatica 55(2):91127. SpringerVerlag, March 2018. 
[BMR+16]  Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, and Daniel Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 106:1106:14. LeibnizZentrum für Informatik, July 2016. 
[BMS11]  Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust ModelChecking of Timed Automata via Pumping in Channel Machines. In FORMATS'11, Lecture Notes in Computer Science 6919, pages 97112. SpringerVerlag, September 2011. 
[BMS12]  Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust reachability in timed automata: a gamebased approach. In ICALP'12, Lecture Notes in Computer Science 7392, pages 128140. SpringerVerlag, July 2012. 
[BMS13]  Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robustness in timed automata. In RP'13, Lecture Notes in Computer Science 8169, pages 118. SpringerVerlag, September 2013. 
[BMS13]  Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust Weighted Timed Automata and Games. In FORMATS'13, Lecture Notes in Computer Science 8053, pages 3146. SpringerVerlag, August 2013. 
[BMS14]  Patricia Bouyer, Nicolas Markey, and Daniel Stan. Mixed Nash Equilibria in Concurrent Games. In FSTTCS'14, Leibniz International Proceedings in Informatics 29, pages 351363. LeibnizZentrum für Informatik, December 2014. 
[BMS15]  Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust Reachability in Timed Automata and Games: A Gamebased Approach. Theoretical Computer Science 563:4374. Elsevier, January 2015. 
[BMS16]  Patricia Bouyer, Nicolas Markey, and Daniel Stan. Stochastic Equilibria under Imprecise Deviations in TerminalReward Concurrent Games. In GandALF'16, Electronic Proceedings in Theoretical Computer Science 226, pages 6175. September 2016. 
[BMS+20]  Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur. Dynamic network congestion games. In FSTTCS'20, Leibniz International Proceedings in Informatics 182, pages 40:140:16. LeibnizZentrum für Informatik, December 2020. 
[BMS+22]  Nathalie Bertrand,
Nicolas Markey,
Suman Sadhukhan, and
Ocan Sankur.
Semilinear Representations for SeriesParallel
Atomic Congestion Games.
In FSTTCS'22,
Leibniz International Proceedings in Informatics 250.
LeibnizZentrum für Informatik, December 2022.

[BMS+22]  Nathalie Bertrand, Nicolas Markey, Ocan Sankur, and Nicolas Waldburger. Parameterized safety verification of roundbased sharedmemory systems. In ICALP'22, Leibniz International Proceedings in Informatics, pages 113:1113:20. LeibnizZentrum für Informatik, July 2022. 
[BMT99]  Augustin Baziramwabo,
Pierre McKenzie, and
Denis Thérien.
Modular Temporal Logic.
In LICS'99,
pages 344351.
IEEE Comp. Soc. Press, July 1999.

[BMV14]  Patricia Bouyer, Nicolas Markey, and Steen Vester. Nash Equilibria in Symmetric Games with Partial Observation. In SR'14, Electronic Proceedings in Theoretical Computer Science 146, pages 4955. March 2014. 
[BMV15]  Dietmar Berwanger,
Anup Basil Mathew, and
Marie Van den Bogaard.
Hierarchical Information Patterns and Distributed
Strategy Synthesis.
In ATVA'15,
Lecture Notes in Computer Science 9364, pages 378393. SpringerVerlag, October 2015.

[BMV17]  Patricia Bouyer, Nicolas Markey, and Steen Vester. Nash Equilibria in Symmetric Graph Games with Partial Observation. Information and Computation 254(2):238258. Elsevier, June 2017. 
[BO04]  Stephen J. Bellantoni and Isabel Oitavem. Separating NC along the δ axis. Theoretical Computer Science 318(12):5778. Elsevier, June 2004. 
[BO16]  Randal E. Bryant and
David R. O'Hallaron.
Computer Systems – A programmer's perspective.
Pearson, 2016.

[Bod88]  Hans L. Bodlaender. Dynamic Programming on Graphs with Bounded Treewidth. In ICALP'88, Lecture Notes in Computer Science 317, pages 105118. SpringerVerlag, July 1988. 
[Bod93]  Hans L. Bodlaender.
A Tourist Guide through Treewidth.
Acta Cybernetica 11(12):121. Institute of Informatics, University of Szeged, 1993.

[Bod96]  Hans L. Bodlaender. A lineartime algorithm for finding treedecompositions of small treewidth. SIAM Journal on Computing 25(6):13051317. Society for Industrial and Applied Math., December 1996. 
[Boj08]  Mikołaj Bojańczyk.
The Common Fragment of ACTL and LTL.
In FoSSaCS'08,
Lecture Notes in Computer Science 4962, pages 172185. SpringerVerlag, March 2008.

[Bou01]  Charles L. Bouton.
Nim, a game with a complete mathematical theory.
Annals of Mathematics 3(14):3539. Princeton University Press, 1901.

[Bou98]  Patricia Bouyer.
Automates temporisés et modularité.
Mémoire de D.E.A.,
Lab. Spécification & Vérification, ENS Cachan,
France,
June 1998.

[Bou02]  Patricia Bouyer.
Timed Automata May Cause some Troubles.
Research Report LSV0209, Lab. Spécification & Vérification, ENS Cachan,
France,
July 2002.

[Bou03]  Patricia Bouyer. Untameable Timed Automata!. In STACS'03, Lecture Notes in Computer Science 2607, pages 620631. SpringerVerlag, February 2003. 
[Bou04]  Patricia Bouyer. Forward Analysis of Updatable Timed Automata. Formal Methods in System Design 24(3):281320. Kluwer Academic, May 2004. 
[Boz08]  Laura Bozzelli.
The complexity of CTL* + Linear
Past.
In FoSSaCS'08,
Lecture Notes in Computer Science 4962, pages 186200. SpringerVerlag, March 2008.

[BP03]  Bruno Blanchet and
Andreas Podelski.
Verification of Cryptographic Protocols: Tagging
Enforces Temrination.
In FoSSaCS'03,
Lecture Notes in Computer Science 2620, pages 136152. SpringerVerlag, April 2003.

[BPM81]  Mordechai BenAri,
Amir Pnueli, and
Zohar Manna.
The Temporal Logic of Branching Time.
In POPL'81,
pages 164176.
ACM Press, January 1981.

[BPM83]  Mordechai BenAri,
Amir Pnueli, and
Zohar Manna.
The Temporal Logic of Branching Time.
Acta Informatica 20:207226. SpringerVerlag, 1983.

[BPR+16]  Romain Brenguier, Guillermo A. Pérez, JeanFrançois Raskin, and Mathieu Sassolas. Admissibility in Quantitative Graph Games. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 42:142:14. LeibnizZentrum für Informatik, December 2016. 
[BR01]  Thomas Ball and
Sriram Rajamani.
The SLAM toolkit.
In CAV'01,
Lecture Notes in Computer Science 2102, pages 260264. SpringerVerlag, July 2001.

[BR02]  Danièle Beauquier and
Alexander Rabinovich.
Monadic Logic of Order over Naturals has no Finite
Base.
Journal of Logic and Computation 12(2):243253. Oxford University Press, April 2002.

[BR03]  Véronique Bruyère and
JeanFrançois Raskin.
RealTime ModelChecking: Parameters Everywhere.
In FSTTCS'03,
Lecture Notes in Computer Science 2914, pages 100111. SpringerVerlag, December 2003.

[Bra98]  Julian C. Bradfield.
The Modal MuCalculus Alternation Hierarchy is
Strict.
Theoretical Computer Science 195(2):133153. Elsevier, March 1998.

[BRB90]  Karl S. Brace,
Richard L. Ruddel, and
Randal E. Bryant.
Efficient Implementation of a BDD package.
In DAC'90,
pages 4045.
IEEE Comp. Soc. Press, June 1990.

[Bre12]  Romain Brenguier.
Nash Equilibria in Concurrent Games –Application to
Timed Games.
Thèse de doctorat,
Lab. Spécification & Vérification, ENS Cachan,
France,
November 2012.

[Bre16]  Romain Brenguier. Optimal Assumptions for Synthesis. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 8:18:15. LeibnizZentrum für Informatik, August 2016. 
[BRS13]  Marcello Maria Bersani, Matteo Rossi, and Pierluigi San Pietro. Deciding the Satisfiability of MITL Specifications. In GandALF'13, Electronic Proceedings in Theoretical Computer Science 119, pages 6478. August 2013. 
[BRS14]  Romain Brenguier, JeanFrançois Raskin, and Mathieu Sassolas. The complexity of admissibility in omegaregular games. In CSL/ LICS'14, pages 23:123:10. ACM Press, July 2014. 
[BRS17]  Romain Brenguier, JeanFrançois Raskin, and Ocan Sankur. Assumeadmissible synthesis. Acta Informatica 54(1):4183. SpringerVerlag, February 2017. 
[Bru13]  Benedikt Brütsch. Synthesizing structured reactive programs via deterministic tree automata. In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 107113. March 2013. 
[Bry86]  Randal E. Bryant.
GraphBased Algorithms for Boolean Function
Manipulation.
IEEE Transactions on Computers 35(8):677691. IEEE Comp. Soc. Press, August 1986.

[BS91]  Janusz A. Brzozowski and
CarlJohan H. Seger.
Advances in Asynchronous Circuit Theory Part II:
Bounded Inertial Delay Models, MOS Circuits,
Design Techniques.
EATCS Bulletin 43:199263. EATCS, February 1991.

[BS95]  Patrick Blackburn and
Jerry Seligman.
Hybrid Languages.
Journal of Logic, Language and Information 4(3):251272. Kluwer Academic, 1995.

[BS98]  Patrick Blackburn and
Jerry Seligman.
What are Hybrid Languages?.
In AIML'96,
pages 4162.
CSLI Publications, 1998.

[BS01]  Julian C. Bradfield and
Colin Stirling.
Modal Logics and MuCalculi: An Introduction.
In Jan A. Bergstra,
Alban Ponse, and
Scott A. Smolka (eds.),
Handbook of Process Algebra.
Elsevier, 2001.

[BS12]  Nathalie Bertrand and Sven Schewe. Playing Optimally on Timed Automata with Random Delays. In FORMATS'12, Lecture Notes in Computer Science 7595, pages 4358. SpringerVerlag, September 2012. 
[BSJ+15]  Nathalie Bertrand, Amélie Stainer, Thierry Jéron, and Moez Krichen. A game approach to determinize timed automata. Formal Methods in System Design 46(1):4280. SpringerVerlag, February 2015. 
[BST98]  Sébastien Bornot,
Joseph Sifakis, and
Stavros Tripakis.
Modeling Urgency in Timed Systems.
In COMPOS'97,
Lecture Notes in Computer Science 1536, pages 103129. SpringerVerlag, 1998.

[BST98]  Paul Beame,
Michael Saks, and
Jayram S. Thathachar.
TimeSpace Tradeoffs for Branching Programs.
Research Report 98053, Electronic Colloquium on Computational Complexity,
September 1998.

[BSV04]  Henrik Björklund, Sven Sandberg, and Sergei Vorobyov. Memoryless Determinacy of Parity and Mean Payoff Games: A Simple Proof. Theoretical Computer Science 310(13):365378. Elsevier, January 2004. 
[BT89]  Dimitri P. Bertsekas and
John N. Tsitsiklis.
Parallel and distributed computation: numerical
methods.
Prentice Hall, 1989.

[BT96]  Dimitri P. Bertsekas and
John N. Tsitsiklis.
NeuroDynamic Programming.
Anthropological Field Studies 3.
Athena Scientific, 1996.

[BT99]  Patrick Blackburn and
Miroslava Tzakova.
Hybrid Languages and Temporal Logic.
Logic Journal of the IGPL 7(1):2754. Oxford University Press, January 1999.

[BT05]  Harry Buhrman and
Leen Torenvliet.
A Post's Program for Complexity Theory.
EATCS Bulletin 85:4151. EATCS, February 2005.

[BTK+02]  Cécile Bui Thanh,
Hanna Klaudel, and
Franck Pommereau.
Petri Nets with Causal Time for System
Verification.
In MTCS'02,
Electronic Notes in Theoretical Computer Science 68(5).
Elsevier, August 2002.

[BTY97]  Ahmed Bouajjani,
Stavros Tripakis, and
Sergio Yovine.
OntheFly Symbolic Model Checking for RealTime
Systems.
In RTSS'97,
pages 2535.
IEEE Comp. Soc. Press, December 1997.

[Buc62]  Julius R. Büchi.
On a Decision Method in Restricted Second Order
Arithmetic.
In LMPS'60,
pages 111.
Stanford University Press, June 1962.

[Bur79]  John P. Burgess.
Logic and Time.
Journal of Symbolic Logic 44(4):566582. Association for Symbolic Logic, December 1979.

[Bur80]  John P. Burgess.
Decidability for Branching Time.
Studia Logica 39(23):203218. Kluwer Academic, 1980.

[Bus87]  Samuel R. Buss.
The Boolean Formula Value Problem is in ALOGTIME.
In STOC'87,
pages 123131.
ACM Press, May 1987.

[Bus93]  Samuel R. Buss.
Algorithms for Boolean Formula Evaluation and for
Tree Contraction.
In Peter Clote and
Jan Krajíček (eds.),
Proof Theory, Complexity, and Arithmetic.
Oxford University Press, 1993.

[Bus97]  Samuel R. Buss.
ALOGTIME Algorithm for Tree Isomorphism,
Comparison, and Canonization.
In KGC'97,
Lecture Notes in Computer Science 1289, pages 1833. SpringerVerlag, August 1997.

[BV07]  Henrik Björklund and Sergei Vorobyov. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Applied Mathematics 155(2):210229. Elsevier, January 2007. 
[BVW94]  Orna Bernholtz,
Moshe Y. Vardi, and
Pierre Wolper.
An AutomataTheoretic Approach to BranchingTime
Model Checking (Extended Abstract).
In CAV'94,
Lecture Notes in Computer Science 818, pages 142155. SpringerVerlag, June 1994.

[BW94]  Bertil A. Brandin and
W. Murray Wonham.
Supervisory Control of Timed DiscreteEvent Systems.
IEEE Transactions on Automatic Control 39(2):329342. IEEE Comp. Soc. Press, February 1994.

[BW17]  Julian C. Bradfield and
Igor Walukiewicz.
The mucalculus and modelchecking.
In Edmund M. Clarke,
Thomas A. Henzinger, and
Helmut Veith (eds.),
Handbook of Model Checking.
SpringerVerlag, 2017. To appear.

[BY03]  Johan Bengtsson and
Wang Yi.
On Clock Difference Constraints and Termination in
Reachability Analysis of Timed Automata.
In ICFEM'03.
SpringerVerlag, November 2003.

[BY04]  Johan Bengtsson and Wang Yi. Timed Automata: Semantics, Algorithms and Tools. In Jörg Desel, Wolfgang Reisig, and Grzegorz Rozenberg (eds.), Lectures on Concurrency and Petri Nets, Lecture Notes in Computer Science 2098, pages 87124. SpringerVerlag, 2004. 
Search
Displayed 310 resultsList of authors
 1
 1
 1
 5
 1
 2
 1
 1
 2
 4
 1
 1
 8
 1
 1
 1
 2
 1
 1
 1
 2
 1
 1
 1
 1
 4
 1
 13
 1
 1
 1
 2
 1
 2
 1
 1
 5
 2
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 4
 18
 2
 6
 3
 1
 1
 2
 1
 4
 1
 1
 2
 1
 4
 1
 1
 1
 2
 1
 3
 1
 1
 4
 2
 3
 3
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 84
 4
 2
 5
 1
 1
 4
 1
 1
 1