Automated Quantitative Verification for Service-Based System Design: A Visualization Transform Tool Perspective

被引:54
作者
Gao, Honghao [1 ,2 ]
Miao, Huaikou [3 ,4 ]
Liu, Lilan [2 ]
Kai, Jinyu [3 ,4 ]
Zhao, Kun [3 ,4 ]
机构
[1] Shanghai Univ, Comp Ctr, Shanghai 200444, Peoples R China
[2] Shanghai Univ, Shanghai Key Lab Intelligent Mfg & Robot, Shanghai 200072, Peoples R China
[3] Shanghai Univ, Sch Comp Engn & Sci, Shanghai 200444, Peoples R China
[4] Shanghai Univ, Shanghai Key Lab Comp Software Testing & Evaluati, Shanghai 201112, Peoples R China
基金
中国国家自然科学基金;
关键词
Service system; design visualization; quantitative verification; probabilistic model checking; model transformations; PLATFORM;
D O I
10.1142/S0218194018500390
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Service-based systems are a new software mode for distributed business processes integration. It is difficult for traditional testing methods to verify the functional and nonfunctional requirements of software. To address this problem, this paper proposes a visual verification platform to quantitatively compute the reliability and cost for evaluating the performance of service-based systems in the design phase. First, an extended automata model namely Probabilistic Reward Labeled Transition System (PRLTS) is proposed to formalize both the functional behaviors and nonfunctional features. Then, the formal language of probabilistic model checker PRISM is introduced to show the grammar of the target verification codes that we want to transform. Second, XML description tags of Business Process Execution Language (BPEL) is parsed to generate the functional behaviors using different kinds of transformation rules, based on which the probability matrix and reward concept are employed to denote the service's reliability and cost, respectively. Third, the PRLTS model is turned into the input language of PRISM, where the graphic description language DOT of Graphviz is used as an intermediary to display system behaviors in a visual way. The model layout allows the designer to manually adjust the behaviors of the PRLTS model, where verification codes can be dynamically updated according to the changes in modified information. Fourth, to perform quantitative verification, the verification property in the form of the Probabilistic Computation Tree Logic (PCTL) formula can be automatically generated when the requirement model of the service-based system is inputted, during which the threshold value of qualitative property will be initially computed and returned as a recommended value. This allows the user to modify the qualitative property in an interactive way. Furthermore, experimental analysis of the real-world case study demonstrates the feasibility of the proposed method. Thus, our platform provides guidance for quantitative verification and graphical visualization for effectively generating formal models and checking the quantitative properties for service-based systems.
引用
收藏
页码:1369 / 1397
页数:29
相关论文
共 37 条
  • [1] [Anonymous], 2008, SOA: Principles of Service Design
  • [2] Apache ODE, 2017, WS BPEL 2 0
  • [3] Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
  • [4] Formal Verification With Confidence Intervals to Establish Quality of Service Properties of Software Systems
    Calinescu, Radu
    Ghezzi, Carlo
    Johnson, Kenneth
    Pezze, Mauro
    Rafiq, Yasmin
    Tamburrelli, Giordano
    [J]. IEEE TRANSACTIONS ON RELIABILITY, 2016, 65 (01) : 107 - 125
  • [5] Copeland Tom., 2007, GENERATING PARSERS J
  • [6] D'Argenio P. R., 2002, Process Algebra and Probabilistic Methods. Performance Modeling and Verification. Second Joint International Workshop PAPM-PROBMIV 2002 Proceedings (Lecture Notes in Computer Science Vol.2399), P57
  • [7] Ellson J, 2004, MATH VIS, P127
  • [8] Ellson J, 2002, LECT NOTES COMPUT SC, V2265, P483
  • [9] Ellson J., 2017, GRAPHVIZ GRAPH VISUA
  • [10] Supporting Self-Adaptation via Quantitative Verification and Sensitivity Analysis at Run Time
    Filieri, Antonio
    Tamburrelli, Giordano
    Ghezzi, Carlo
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2016, 42 (01) : 75 - 99