The 17 revised full papers presented were carefully reviewed and selected from 36 submissions. The papers cover topics of foundations and semantics; comparison between different models, such as timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models; methods and tools for analyzing timed systems and resolving temporal constraints; applications in real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication.
The 17 revised full papers presented were carefully reviewed and selected from 36 submissions.
The Modeling and Analysis of Mixed-Criticality Systems.- Modeling Bitcoin Contracts by Timed Automata.- Data-Driven Statistical Learning of Temporal Logic Properties.- Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices.- Delay-Dependent Partial Order Reduction Technique for Time Petri Nets.- On MITL and Alternating Timed Automata over Infinite Words.- Time Petri Nets with Dynamic Firing Dates: Semantics and Applications.- Verification and Performance Evaluation of Timed Game Strategies.- The Power of Proofs: New Algorithms for Timed Automata Model Checking.- Anonymized Reachability of Hybrid Automata Networks.- Combined Global and Local Search for the Falsification of Hybrid Systems.- Weak Singular Hybrid Automata.- Non-convex Invariants and Urgency Conditions on Linear Hybrid Automata.- Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints.- Virtual Integration of Real-Time Systems Based on Resource Segregation Abstraction.- Timed Pattern Matching.- Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets.