Timed Automata and Timed Languages Challenges and Open Problems -- Towards Efficient Partition Refinement for Checking Reachability in Timed Automata -- Checking ACTL * Properties of Discrete Timed Automata via Bounded Model Checking -- 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 -- Causal Time Calculus -- ELSE: A New Symbolic State Generator for Timed Automata.

This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Formal Modeling and Analysis of Timed Systems, FORMATS 2003, held in Marseille, France in September 2003. The 19 revised full papers presented together with an invited paper and the abstracts of two invited talks were carefully selected from 36 submissions during two rounds of reviewing and improvement. All current aspects of formal method for modeling and analyzing timed systems are addressed; among the timed systems dealt with are timed automata, timed Petri nets, max-plus algebras, real-time systems, discrete time systems, timed languages, and real-time operating systems.