Analysis of timed systems using time-abstracting bisimulations
From MaRDI portal
Recommendations
Cited in
(42)- A survey of timed automata for the development of real-time systems
- Reducing clocks in timed automata while preserving bisimulation
- Explaining safety violations in real-time systems
- Folk theorems on the determinization and minimization of timed automata
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Bounded model checking for knowledge and real time
- Time-abstracted bisimulation: Implicit specifications and decidability
- Automated Technology for Verification and Analysis
- scientific article; zbMATH DE number 2080039 (Why is no real title available?)
- Accuracy of message counting abstraction in fault-tolerant distributed algorithms
- A compositional translation of timed automata with deadlines to Uppaal timed automata
- Shrinking timed automata
- SetExp: a method of transformation of timed automata into finite state automata
- Predicate diagrams for the verification of real-time systems
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- On clock-aware LTL parameter synthesis of timed automata
- Checking timed Büchi automata emptiness efficiently
- On Abstractions for Timing Analysis in the $\mathbb{K}$ Framework
- Predicate abstraction for dense real-time systems
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Model Checking Real-Time Systems
- scientific article; zbMATH DE number 1956585 (Why is no real title available?)
- Better abstractions for timed automata
- Dense integer-complete synthesis for bounded parametric timed automata
- Model-checking timed automata with deadlines with Uppaal
- Time abstracted bisimulation: Implicit specifications and decidability
- Efficient scaling-invariant checking of timed bisimulation
- On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
- scientific article; zbMATH DE number 7566044 (Why is no real title available?)
- A menagerie of timed automata
- The cones and foci proof technique for timed transition systems
- Expressiveness of verifiable hierarchical clock systems
- Formal verification of timed systems using cones and foci
- Verifying abstractions of timed systems
- Guest editorial: Special issue on formal modeling and analysis of timed systems
- scientific article; zbMATH DE number 1948411 (Why is no real title available?)
- On model-checking timed automata with stopwatch observers
- A unified model for real-time systems: symbolic techniques and implementation
- Automata with timers
- scientific article; zbMATH DE number 1799517 (Why is no real title available?)
- Automatic abstraction algorithm for timed automata
- Bounded model checking for timed automata
This page was built for publication: Analysis of timed systems using time-abstracting bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929099)
