Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers
Author: Kim Guldstrand Larsen, Peter Niebert
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-21671-1
DOI: 10.1007/b12025

Table of Contents:

• Timed Automata and Timed Languages Challenges and Open Problems
  
• Towards Efficient Partition Refinement for Checking Reachability in Timed Automata
  
• Checking ACTL
  
• Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently
  
• Adding Symmetry Reduction to Uppaal
  
• TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems
  
• Optimization of Timed Automata Models Using Mixed-Integer Programming
  
• Discrete-Time Rewards Model-Checked
  
• Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
  
• An Interval-Based Algebra for Restricted Event Detection
  
• PARS: A Process Algebra with Resources and Schedulers
  
• Formal Semantics of Hybrid Chi
  
• Run-Time Guarantees for Real-Time Systems
  
• A Nonarchimedian Discretization for Timed Languages
  
• Folk Theorems on the Determinization and Minimization of Timed Automata
  
• Control Synthesis for a Smart Card Personalization System Using Symbolic Model Checking
  
• On Timing Analysis of Combinational Circuits
  
• Analysis of Real Time Operating System Based Applications
  
• Time-Optimal Test Cases for Real-Time Systems
  
• Using Zone Graph Method for Computing the State Space of a Time Petri Net