Better abstractions for timed automata

DOI10.1016/j.ic.2016.07.004zbMath1353.68166OpenAlexW2962719417MaRDI QIDQ342707

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

Publication date: 18 November 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.07.004

zbMATH Keywords

timed automatanon-convex abstractionsreachability problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Verified Certification of Reachability Checking for Timed Automata, Spotlight abstraction in model checking real-time task schedulability, Energy Büchi problems, Unnamed Item, Reachability relations of timed pushdown automata, Backward symbolic optimal reachability in weighted timed automata, Certifying emptiness of timed Büchi automata, Unnamed Item, Unnamed Item, Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security, Zone-based verification of timed automata: extrapolations, simulations and what next?, Efficient convex zone merging in parametric timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quadratic-time DBM-based successor algorithm for checking timed automata
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Forward analysis of updatable timed automata
• Better Abstractions for Timed Automata
• Deciding Linear Inequalities by Computing Loop Residues
• Symbolic Optimal Reachability in Weighted Timed Automata
• Model-checking Timed Temporal Logics
• Lectures on Concurrency and Petri Nets
• Analysis of timed systems using time-abstracting bisimulations
• Verifying abstractions of timed systems