Decidable integration graphs.

DOI10.1006/inco.1998.2774zbMath1045.68566OpenAlexW1979561589MaRDI QIDQ1854273

Amir Pnueli, Sergio Yovine, Joseph Sifakis, Yonit Kesten

Publication date: 14 January 2003

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

Full work available at URL: https://semanticscholar.org/paper/2451566a40234df77072b7b0517695592b946791

zbMATH Keywords

reachability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

On the optimal reachability problem of weighted timed automata ⋮ On the expressiveness and decidability of o-minimal hybrid systems ⋮ Optimal paths in weighted timed automata ⋮ Duration calculus: Logical foundations ⋮ Interrupt timed automata: verification and expressiveness ⋮ Verification of duration systems using an approximation approach ⋮ Concavely-Priced Timed Automata ⋮ On some relations between dynamical systems and transition systems ⋮ MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS ⋮ On model-checking timed automata with stopwatch observers ⋮ Symbolic verification of hybrid systems: an algebraic approach ⋮ Interrupt Timed Automata ⋮ Interval Duration Logic ⋮ Positive loop-closed automata: A decidable class of hybrid systems ⋮ Uniformity for the decidability of hybrid automata

Uses Software

• Kronos

Cites Work

• Unnamed Item
• The algorithmic analysis of hybrid systems
• Real-time logics: Complexity and expressiveness
• A calculus of durations
• Symbolic model checking: \(10^{20}\) states and beyond
• A theory of timed automata
• From ATP to timed graphs and hybrid systems
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• On the complexity of integer programming
• What good are digital clocks?