基于事件确定有限自动机的UML2.0序列图描述与验证

Specification and Verification of UML2.0 Sequence Diagrams Based on Event Deterministic Finite Automata

为了确保软件分析与设计阶段UML2.0序列图模型的可靠性,采用命题投影时序逻辑(propositional projection temporal logic,简称PPTL)模型检测方法对该模型进行分析和验证.提出了事件确定有限自动机(event deterministic finite automata,简称ETDFA),并使用该自动机为序列图建立形式化模型,通过给出的基于ETDFA的PPTL模型检测算法得到验证结果.该方法可以在基于Spin的PPTL模型检测器的支持下实现.实例结果表明,该方法可以验证序列图的性质并保证其可靠性.

To ensure the reliability of UML2.0 sequence diagrams（SD）,which are used in software analysis and design,propositional projection temporal logic（PPTL） model checking is adopted in this paper.First,event deterministic finite automata（ETDFA） are proposed and used to describe the formal models of SD.Furthermore,an algorithm for model checking ETDFA with PPTL formulas being the properties is presented.Finally,based on the implementation of PPTL model checker,the ETDFA models of SD are verified.Experimental results show that the proposed method is useful in ensuring the reliability of SD.