Verification of duration systems using an approximation approach

DOI10.1007/BF02948880MaRDI QIDQ1429422zbMATH OpenOpenAlexFDO

Authors 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

approximationdigitizationduration graphsmodel checking

Mathematics Subject Classification ID

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

Recommendations

• Theoretical Aspects of Computing - ICTAC 2004
• Checking temporal duration properties of timed automata.
• Digitizing interval duration logic.
• What good are digital clocks?
• scientific article; zbMATH DE number 2080039

Cites work

• A calculus of durations
• Decidable integration graphs.
• From ATP to timed graphs and hybrid systems
• scientific article; zbMATH DE number 1670786 (Why is no real title available?)
• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 1759608 (Why is no real title available?)
• Symbolic model checking for real-time systems
• The algorithmic analysis of hybrid systems
• What's decidable about hybrid automata?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429422)