Better abstractions for timed automata
From MaRDI portal
Publication:342707
DOI10.1016/J.IC.2016.07.004zbMATH Open1353.68166OpenAlexW2962719417MaRDI QIDQ342707FDOQ342707
Authors: Frédéric Herbreteau, B. Srivathsan, 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
Recommendations
- Better abstractions for timed automata
- Automatic Abstraction Refinement for Timed Automata
- Automatic abstraction algorithm for timed automata
- Trace abstraction refinement for timed automata
- scientific article; zbMATH DE number 1796133
- On timed models and full abstraction
- Lectures on Concurrency and Petri Nets
- Improvements for the Symbolic Verification of Timed Automata
- Complete abstractions of dynamical systems by timed automata
Cites Work
- A theory of timed automata
- Lectures on Concurrency and Petri Nets
- Automatic verification of real-time systems with discrete probability distributions.
- Deciding Linear Inequalities by Computing Loop Residues
- A quadratic-time DBM-based successor algorithm for checking timed automata
- Forward analysis of updatable timed automata
- Using non-convex approximations for efficient analysis of timed automata
- Better abstractions for timed automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symbolic optimal reachability in weighted timed automata
- Model-checking timed temporal logics
- Analysis of timed systems using time-abstracting bisimulations
- Verifying abstractions of timed systems
Cited In (24)
- Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
- Reachability in timed automata with diagonal constraints
- Spotlight abstraction in model checking real-time task schedulability
- Certifying emptiness of timed Büchi automata
- Efficient convex zone merging in parametric timed automata
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Backward symbolic optimal reachability in weighted timed automata
- Difference bound constraint abstraction for timed automata reachability checking
- Trading plaintext-awareness for simulatability to achieve chosen ciphertext security
- Using non-convex approximations for efficient analysis of timed automata
- Reachability relations of timed pushdown automata
- Automatic Abstraction Refinement for Timed Automata
- Title not available (Why is that?)
- Energy Büchi problems
- From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Better abstractions for timed automata
- Checking timed Büchi automata emptiness using LU-abstractions
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
- Title not available (Why is that?)
- Verified certification of reachability checking for timed automata
- On Interleaving in Timed Automata
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Better abstractions for timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342707)
