Formal Modeling and Analysis of Timed Systems

<p>On the Semantics of Polychronous Polytimed Specifications.- Backward Symbolic Optimal Reachability in Weighted Timed Automata.- Certifying Emptiness of Timed Büchi Automata.- Learning Specifications for Labelled Patterns.- On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games.- Computing Maximally-Permissive Strategies in Acyclic Timed Games.- Dynamic Causes for the Violation of Timed Reachability Properties.- Active Learning of Timed Automata with Unknown Resets.- Computation of Transient in Max-Plus Linear Systems via SMT-Solving.- Clairvoyant Monitoring for Signal Temporal Logic Patterns.- Embedding Online RV for Fault Disambiguation on Robonaut2.- Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata.- Probabilistic Guarantees for Safe Deep Reinforcement Learning.- Incremental Methods for Checking Real-Time Consistency.- Reachability Analysis of Nonlinear Systems Using Hybridization and Dynamics Scaling.- Weakness Monitors for Fail-Aware Systems.</p>