Decidable integration graphs.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1263213 (Why is no real title available?)
- A calculus of durations
- A theory of timed automata
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- From ATP to timed graphs and hybrid systems
- On the complexity of integer programming
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Real-time logics: Complexity and expressiveness
- Symbolic model checking: \(10^{20}\) states and beyond
- The algorithmic analysis of hybrid systems
- What good are digital clocks?
Cited in
(15)- Optimal paths in weighted timed automata
- Positive loop-closed automata: A decidable class of hybrid systems
- On some relations between dynamical systems and transition systems
- On the expressiveness and decidability of o-minimal hybrid systems
- Interrupt timed automata: verification and expressiveness
- Modeling and analysis of real-time systems with mutex components
- Interval duration logic: expressiveness and decidability
- Verification of duration systems using an approximation approach
- Uniformity for the decidability of hybrid automata
- Duration calculus: Logical foundations
- On the optimal reachability problem of weighted timed automata
- Symbolic verification of hybrid systems: an algebraic approach
- Concavely-Priced Timed Automata
- Interrupt Timed Automata
- On model-checking timed automata with stopwatch observers
This page was built for publication: Decidable integration graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854273)
