- Raymond Devillers and Hanna Klaudel. Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
- Masaki Waga, Takumi Akazaki and Ichiro Hasuo. A Boyer-Moore Type Algorithm for Timed Pattern Matching
- Majid Zamani, Soumyajit Dey, Sajid Mohamed, Pallab Dasgupta and Manuel Mazo Jr. Scheduling of Controllers’ Update-rates for Residual Bandwidth Utilization
- Zhengkui Zhang, Brian Nielsen and Kim Guldstrand Larsen. Distributed Algorithms for Time Optimal Reachability Analysis
- Michael Mendler, Partha Roop and Bruno Bodin. A Novel WCET semantics of Synchronous Programs
- Olga Gadyatskaya, Rene Rydhof Hansen, Mads Chr. Olesen, Kim Guldstrand Larsen, Axel Legay and Danny Bøgsted Poulsen. Modelling Attack-Defense Trees using Timed Automata
- Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege and Nathalie Sznajder. Real-time Synthesis is Hard!
- Étienne André, Didier Lime and Olivier H. Roux. On the Expressiveness of Parametric Timed Automata
- Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov and Carolyn Talcott. Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
- Susmit Jha and Vasumathi Raman. Towards Automated Synthesis of Stochastic Linear Hybrid Systems Controllers
- Stefanos Skalistis and Alena Simalatsar. Worst-case execution time analysis for many-core architectures with NoC
- Pedro R. D’Argenio, Matias David Lee and Raúl E. Monti. Input/Output Stochastic Automata: Compositionality and Determinism
- Gustavo Patino and Wang Jiang Chau. Scenario-Aware Workload Characterization based on a Max-Plus Linear Representation
- Leonid Dworzanski. Consistent Timed Semantics for Nested Petri Nets with Restricted Urgency