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

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

张琛,段振华,田聪.基于事件确定有限自动机的UML2.0 序列图描述与验证.软件学报,2011,22(11):2625-2638

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 23,2010
  • Revised:December 09,2010
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063