axiomatising timed automata | |
Lin Huimin ; Yi W | |
刊名 | Acta Informatica
![]() |
2002 | |
卷号 | 38期号:4页码:277-305 |
关键词 | REGULAR BEHAVIORS |
通讯作者 | Lin, HM (通讯作者), Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China |
收录类别 | SCI |
WOS记录号 | WOS:000174125000003 |
公开日期 | 2010-08-24 |
附注 | Timed automata has been developed as a basic semantic model for real time systems. Its algorithmic aspects for automated analysis have been well studied. But so far there is still no satisfactory algebraic theory to allow the derivation of semantical equivalence of automata by purely syntactical manipulation. The aim of this paper is to provide such a theory. We present an inference system of timed bisimulation equivalence for timed automata based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form phi t = u where phi is a clock constraint and t, u are terms denoting timed automata. The inference system is shown to be sound and complete for timed bisimulation. The proof of the completeness result relies on the notion of symbolic tinned bisimulation, adapted from the work on value-passing processes. |
内容类型 | 期刊论文 |
源URL | [http://124.16.136.157/handle/311060/4494] ![]() |
专题 | 软件研究所_计算机科学国家重点实验室 _期刊论文 |
推荐引用方式 GB/T 7714 | Lin Huimin,Yi W. axiomatising timed automata[J]. Acta Informatica,2002,38(4):277-305. |
APA | Lin Huimin,&Yi W.(2002).axiomatising timed automata.Acta Informatica,38(4),277-305. |
MLA | Lin Huimin,et al."axiomatising timed automata".Acta Informatica 38.4(2002):277-305. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论