中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
Super-dense computation in verification of hybrid CSP processes
Author: Guelev, Dimitar P. (1) ; Wang, Shuling (2) ; Zhan, Naijun (2) ; Zhou, Chaochen (2)
Conference Name: 10th International Symposium on Formal Aspects of Component Software, FACS 2013
Conference Date: October 27, 2013 - October 29, 2013
Issued Date: 2014
Conference Place: Nanchang, China
Keyword: Hybrid system ; Differential invariant ; Hybrid CSP ; Duration Calculus ; Super-dense computation ; Hybrid Hoare logic
Corresponding Author: Wang, S.(wangsl@ios.ac.cn)
Publish Place: Springer Verlag
Indexed Type: CPCI ; EI
ISSN: 3029743
ISBN: 9783319076010
Department: (1) Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria; (2) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Abstract: Hybrid Communicating Sequential Processes (HCSP) extends CSP to include differential equations and interruptions. We feel comfortable in our experience with HCSP to model scenarios of the Level 3 of Chinese Train Control System (CTCS-3), and to define a formal semantics for Simulink. The Hoare style calculus of [5] proposes a calculus to verify HCSP processes. However it has an error with respect to super-dense computation. This paper is to establish another calculus for a subset of HCSP, which uses Duration Calculus formulas to record program history, negligible time state to denote super-dense computation and semantic continuation to avoid infinite interval. It is compositional and sound. © 2014 Springer International Publishing Switzerland.
English Abstract: Hybrid Communicating Sequential Processes (HCSP) extends CSP to include differential equations and interruptions. We feel comfortable in our experience with HCSP to model scenarios of the Level 3 of Chinese Train Control System (CTCS-3), and to define a formal semantics for Simulink. The Hoare style calculus of [5] proposes a calculus to verify HCSP processes. However it has an error with respect to super-dense computation. This paper is to establish another calculus for a subset of HCSP, which uses Duration Calculus formulas to record program history, negligible time state to denote super-dense computation and semantic continuation to avoid infinite interval. It is compositional and sound. © 2014 Springer International Publishing Switzerland.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16514
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Guelev, Dimitar P. ,Wang, Shuling ,Zhan, Naijun ,et al. Super-dense computation in verification of hybrid CSP processes[C]. 见:10th International Symposium on Formal Aspects of Component Software, FACS 2013. Nanchang, China. October 27, 2013 - October 29, 2013.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Guelev, Dimitar P. (1)]'s Articles
[Wang, Shuling (2)]'s Articles
[Zhan, Naijun (2)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Guelev, Dimitar P. (1)]‘s Articles
[Wang, Shuling (2)]‘s Articles
[Zhan, Naijun (2)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace