首页 | 本学科首页   官方微博 | 高级检索  
     


An Equivalent CTL Formulation for Condition Sequences
Authors:Jeffrey?Ashley  author-information"  >  author-information__contact u-icon-before"  >  mailto:ashley@engr.uky.edu"   title="  ashley@engr.uky.edu"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author,Lawrence?E.?Holloway
Affiliation:(1) Center for Manufacturing, University of Kentucky, Lexington, KY 40506, USA;(2) Department of Electrical and Computer Engineering and Center for Manufacturing, University of Kentucky, Lexington, Kentucky 40506, USA
Abstract:A condition system is a form of Petri net that interacts with other condition systems and the environment via state-based signals called conditions. The condition language framework has been used in previous papers to characterize the input/output behavior of such interacting systems, as well as to specify desired control behavior among other things. In this paper, we show that condition sequences (the specification) and condition systems (the model of the system) have an equivalent structure in the computation tree logic (CTL) framework. The primary goals of this work are to be able to utilize existing tools for program verification for our systems, and to make our work more accessible to the temporal logic community.
Keywords:temporal logic  computation tree logic (CTL)  discrete event systems (DES)  condition systems
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号