%0 Journal Article
%T Verification of Duration Systems Using an Approximation Approach
%A Riadh Robbana
%A <br>RiadhRobbana
%J 计算机科学技术学报
%D 2003
%I 
%X We consider the verification problem of invariance properties for timed systems modeled by (extended) Timed Graphs with duration variables. This problem is in general case undecidable. Nevertheless we give in this paper a technique extending a given system into another one containing the initial computations as well as additional ones. Then we define a digitization technique allowing the translation from the continuous case to the discrete one. Using this digitization, we show that to each real computation in the initial system corresponds a discrete computation in the extended system. Then, we show that the extended system corresponds to a very close approximation of the initial one, allowing per consequent, a good analysis of invariance properties of the initial system.
%K model checking
%K duration graphs
%K approximation
%K digitization<br>检测模型
%K 近似值
%K 数字化
%K 离散计算
%K 时间图表
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=6CCA2F3C9993B9CFE951991586E3E76D&yid=D43C4A19B2EE3C0A&vid=13553B2D12F347E8&iid=0B39A22176CE99FB&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=21