Title: Formal modeling and analysis of timed systems
Description: Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers<br />Author: Kim Guldstrand Larsen, Peter Niebert<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-21671-1<br /> DOI: 10.1007/b12025<br /><br />Table of Contents:<p></p><ul><li>Timed Automata and Timed Languages Challenges and Open Problems
</li><li>Towards Efficient Partition Refinement for Checking Reachability in Timed Automata
</li><li>Checking ACTL
</li><li>Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently
</li><li>Adding Symmetry Reduction to Uppaal
</li><li>TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems
</li><li>Optimization of Timed Automata Models Using Mixed-Integer Programming
</li><li>Discrete-Time Rewards Model-Checked
</li><li>Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
</li><li>An Interval-Based Algebra for Restricted Event Detection
</li><li>PARS: A Process Algebra with Resources and Schedulers
</li><li>Formal Semantics of Hybrid Chi
</li><li>Run-Time Guarantees for Real-Time Systems
</li><li>A Nonarchimedian Discretization for Timed Languages
</li><li>Folk Theorems on the Determinization and Minimization of Timed Automata
</li><li>Control Synthesis for a Smart Card Personalization System Using Symbolic Model Checking
</li><li>On Timing Analysis of Combinational Circuits
</li><li>Analysis of Real Time Operating System Based Applications
</li><li>Time-Optimal Test Cases for Real-Time Systems
</li><li>Using Zone Graph Method for Computing the State Space of a Time Petri Net</li></ul>
Subjects: Formal methods (Computer science), Computer simulation, Congresses, Temporal automata, Automata