Verification of duration systems using an approximation approach

DOI10.1007/BF02948880zbMath1089.68565OpenAlexW2051092818MaRDI QIDQ1429422

Riadh Robbana

Publication date: 18 May 2004

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948880

zbMATH Keywords

approximationmodel checkingdigitizationduration graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• A calculus of durations
• What's decidable about hybrid automata?
• From ATP to timed graphs and hybrid systems
• Symbolic model checking for real-time systems
• Decidable integration graphs.

This page was built for publication: Verification of duration systems using an approximation approach