Better Abstractions for Timed Automata

DOI10.1109/LICS.2012.48zbMath1360.68560arXiv1110.3705OpenAlexW2091971051MaRDI QIDQ2986813

Frédéric Herbreteau, Igor Walukiewicz, B. Srivathsan

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.3705

zbMATH Keywords

real-time systemsreachability analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Configurable verification of timed automata with discrete variables ⋮ Lazy Reachability Checking for Timed Automata with Discrete Variables ⋮ An integer static analysis for better extrapolation in Uppaal ⋮ Fast zone-based algorithms for reachability in pushdown timed automata ⋮ Better abstractions for timed automata ⋮ Unnamed Item ⋮ Lazy Abstraction-Based Controller Synthesis ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

This page was built for publication: Better Abstractions for Timed Automata