Efficient methods for highly parallel timed systems
The thesis deals with theoretical and practical aspects of the analysis of timed systems. The goal is to develop new verification algorithms and tools for such systems based on partial-order reduction techniques. These are very powerful techniques proposed for verification of finite state systems, but their transfer to timed setting remains a challenge. A successful application of these techniques in the timed setting will have a very important impact on verification of systems with many parallel components.