中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
computing semi-algebraic invariants for polynomial dynamical systems
Author: Liu Jiang ; Zhan Naijun ; Zhao Hengjun
Source: Embedded Systems Week 2011, ESWEEK 2011 - Proceedings of the 9th ACM International Conference on Embedded Software, EMSOFT'11
Conference Name: Embedded Systems Week 2011, ESWEEK 2011 - 9th ACM International Conference on Embedded Software, EMSOFT'11
Conference Date: October 9,
Issued Date: 2011
Conference Place: Taipei, Taiwan
Keyword: Embedded software ; Embedded systems ; Polynomials
Indexed Type: EI
ISBN: 9781450307147
Department: (1) State Key Lab. of Comp. Sci. Institute of Software Chinese Academy of Sciences China; (2) Zhong Guan Cun No. 4 South Fourth Street Beijing 100190 P.R. China
Sponsorship: IEEE Council on Electronic Design Automation (CEDA); IEEE Circuits and Systems Society; IEEE Computer Society; ACM SIGMICRO; Special Interest Group on Embedded Systems (ACM SIGBED); Special Interest Group on Design Automation (ACM SIGDA)
Abstract: In this paper, we consider an extended concept of invariant for polynomial dynamical systems (PDSs) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAIs) for such PDSs. The main idea is encoding relevant dynamical properties as conditions on the high order Lie derivatives of polynomials occurring in the SAI. A direct consequence of this criterion is a relatively complete method of SAI generation based on template assumption and semi-algebraic constraint solving. Relative completeness means if there is an SAI in the form of a predefined template, then our method can indeed find one. Copyright © 2011 ACM.
English Abstract: In this paper, we consider an extended concept of invariant for polynomial dynamical systems (PDSs) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAIs) for such PDSs. The main idea is encoding relevant dynamical properties as conditions on the high order Lie derivatives of polynomials occurring in the SAI. A direct consequence of this criterion is a relatively complete method of SAI generation based on template assumption and semi-algebraic constraint solving. Relative completeness means if there is an SAI in the form of a predefined template, then our method can indeed find one. Copyright © 2011 ACM.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16221
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Liu Jiang,Zhan Naijun,Zhao Hengjun. computing semi-algebraic invariants for polynomial dynamical systems[C]. 见:Embedded Systems Week 2011, ESWEEK 2011 - 9th ACM International Conference on Embedded Software, EMSOFT'11. Taipei, Taiwan. October 9,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Liu Jiang]'s Articles
[Zhan Naijun]'s Articles
[Zhao Hengjun]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Liu Jiang]‘s Articles
[Zhan Naijun]‘s Articles
[Zhao Hengjun]‘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