7. FORMATS 2009: Budapest, Hungary

• Nikolaj Bjørner, Leonardo Mendonça de Moura:
  Tapas: Theory Combinations and Practical Applications. 1-6
  
• Stephane Gaubert:
  Max-plus Algebraic Tools for Discrete Event Systems, Static Analysis, and Zero-Sum Games. 7-11
  
• George J. Pappas:
  Approximations of Discrete, Continuous, and Hybrid Systems. 12
  
• Eugene Asarin, Aldric Degorre:
  Volume and Entropy of Regular Timed Languages: Analytic Approach. 13-27
  
• Gilles Benattar, Franck Cassez, Didier Lime, Olivier H. Roux:
  Synthesis of Non-Interferent Timed Systems. 28-42
  
• Anne Bouillard, Stefan Haar, Sidney Rosario:
  Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net. 43-57
  
• Víctor A. Braberman, Diego Garbervetsky, Nicolas Kicillof, Daniel Monteverde, Alfredo Olivero:
  Speeding Up Model Checking of Timed-Models by Combining Scenario Specialization and Live Component Analysis. 58-72
  
• Peter Bulychev, Thomas Chatain, Alexandre David, Kim Guldstrand Larsen:
  Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation. 73-87
  
• Ashish Chiplunkar, Shankara Narayanan Krishna, Chinmay Jain:
  Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata. 88-102
  
• Christian Colombo, Gordon J. Pace, Gerardo Schneider:
  Safe Runtime Verification of Real-Time Properties. 103-117
  
• Catalin Dima, Ruggero Lanotte:
  Removing All Silent Transitions from Timed Automata. 118-132
  
• Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert:
  Realizability of Real-Time Logics. 133-148
  
• Martin Fränzle, Mani Swaminathan:
  Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata. 149-163
  
• Pierre Ganty, Rupak Majumdar:
  Analyzing Real-Time Event-Driven Programs. 164-178
  
• Rodolfo Gómez:
  A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata. 179-194
  
• Joost-Pieter Katoen, Daniel Klink, Martin R. Neuhäußer:
  Compositional Abstraction for Stochastic Systems. 195-211
  
• Marta Z. Kwiatkowska, Gethin Norman, David Parker:
  Stochastic Games for Verification of Probabilistic Timed Automata. 212-227
  
• Guangyuan Li:
  Checking Timed Büchi Automata Emptiness Using LU-Abstractions. 228-242
  
• Karin Quaas:
  On the Supports of Recognizable Timed Series. 243-257
  
• Shinya Umeno:
  Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction. 258-274
  
• Matthias Woehrle, Kai Lampka, Lothar Thiele:
  Exploiting Timed Automata for Conformance Testing of Power Measurements. 275-290