Robust synthesis for real-time systems

DOI10.1016/j.tcs.2013.08.015zbMath1311.68088OpenAlexW2087480266MaRDI QIDQ386617

Andrzej Wąsowski, Axel Legay, Louis-Marie Traonouez, Kim Guldstrand Larsen

Publication date: 10 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.015

zbMATH Keywords

robustnessstepwise refinementtimed gamesspecification theorytimed I/O automata

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Progress-preserving Refinements of CTA ⋮ Specification Theories for Probabilistic and Real-Time Systems ⋮ Compositionality for quantitative specifications

Uses Software

• ECDAR
• SPIN
• PPL
• PyEcdar
• UPPAAL TIGA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust safety of timed automata
• A theory of timed automata
• Symbolic model checking for real-time systems
• Linear parametric model checking of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Shrinking Timed Automata.
• Timed I/O automata
• Quantitative Robustness Analysis of Flat Timed Automata
• Timed Automata Can Always Be Made Implementable
• Statistical Model Checking for Networks of Priced Timed Automata
• Robust Model-Checking of Timed Automata via Pumping in Channel Machines
• Robust Specification of Real Time Components
• Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
• On the synthesis of discrete controllers for timed systems
• Parametric real-time reasoning
• CONCUR 2005 – Concurrency Theory
• Timed Parity Games: Complexity and Robustness

This page was built for publication: Robust synthesis for real-time systems