基于LTS的Statecharts操作语义研究  

Study on Operation Semantics of Statecharts Based on LTS

作　　者：钱俊彦[1] 赵岭忠[1] 

机构地区：[1]桂林电子工业学院计算机系,桂林541004

出　　处：《计算机工程》2006年第22期43-45,共3页Computer Engineering

基　　金：广西自然科学基金资助项目(0542036)

摘　　要：Statecharts是一种用于复杂反应式系统行为的可视化规格语言。该文提出了一种基于标签变迁系统(LTS)的Statecharts操作语义描述方法,介绍了Statecharts及其项语法和一步语义,并基于进程代数描述Statecharts的并发行为,使用结构化的操作语义SOS规则描述Statecharts的组合语义,从而得到相应的LTS。Statecharts that extends the finite state machine is a visual language for specifying the behavior of complex reactive system. The state ot： timed Statecharts is represented by inductive term from kind of term algebra, and a step semantics of timed Statecharts is briefly introduced. Based on process algebra, this paper discusses concurrent behavior for Statecharts by concurrent interleaving sequences, It describes a compositional approach for formalizing the Statecharts semantics directly on sequences of micro steps using labeled transition systems as semantics domain, The results suggest that a concise compositional semantics of timed Statecharts is basal and helpful fnr model checking Statecharts.

关 键 词：STATECHARTS 操作语义 标签变迁系统 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]