Computation tree measurement language (CTML)

Computation Tree Measurement Language (CTML) is a newly developed formal language that offers simultaneous model verification and performance evaluation measures. While the theory behind CTML has been established, the language has yet to be tested on a practical example. In this work, we wish to demonstrate the utility of CTML when applied to a real-world application based in manufacturing. Mobile manipulators may enable more flexible, dynamic workflows within industry. Therefore, an artifact-based performance measurement test method for mobile manipulator robots developed at the National Institute of Standards and Technology was selected for evaluation. Contributions of this work include the modeling of robot tasks implemented for the performance measurement test using Petri nets, as well as the formulation and execution of sample queries using CTML. To compare the numerical results, query support, ease of implementation, and empirical runtime of CTML to other temporal logics in such applications, the queries were re-formulated and evaluated using the PRISM Model Checker. Finally, a discussion is included that considers future extensions of this work, relative to other existing research, that could potentially enable the integration of CTML with Systems Modeling Language (SysML) and Product Life-cycle Management (PLM) software solutions.

show abstract

Formal Modeling and Performance Evaluation for Hybrid Systems: A Probabilistic Hybrid Process Algebra-Based Approach

Wang

Cao

Tan

et al. 2022

Int. J. Soft. Eng. Knowl. Eng.

View full text Add to dashboard Cite

Probabilistic behavior is omnipresent in computer-controlled systems, in particular, so-called safety-critical hybrid systems, due to various reasons, like uncertain environments or fundamental properties of nature. In this paper, we extend the existing hybrid process algebra ACP[Formula: see text] with probability without sacrificing the nondeterministic choice operator. The existing approximate probabilistic bisimulation relation is fragile and not robust in the sense of being dependent on the deviation range of the transition probability. To overcome this defect, a novel approximate probabilistic bisimulation is proposed which is inspired by the idea of Probably Approximately Correct (PAC) by relaxing the constraints of transition probability deviation range. Traditional temporal logics, even probabilistic temporal logics, are expressive enough, but they are limited to producing only true or false responses, as they are still logics and not suitable for performance evaluation. To settle this problem, we present a new performance evaluation language that expands quantitative analysis from the value range of [Formula: see text] to real number to reason over probabilistic systems. After that, the corresponding algorithms for performance evaluation are given. Finally, an industrial example is given to demonstrate the effectiveness of our method.

show abstract

Computation tree measurement language (CTML)

Abstract: In this work, we present a formal language, CTML, to reason over probabilistic systems. CTML extends stochastic temporal logics in a way that it takes a real value as input and output a real value in the range of [ 0 , ∞ ) , as opposed to 0/1 values as input and output, and … Show more

Cited by 5 publications

References 39 publications

A Language for Performance Evaluation Based on the Combination of CTRML and MMTD and Its Algorithm

A Language for Performance Evaluation Based on the Combination of CTRML and MMTD and Its Algorithm

Formalizing Performance Evaluation of Mobile Manipulator Robots Using CTML

Formal Modeling and Performance Evaluation for Hybrid Systems: A Probabilistic Hybrid Process Algebra-Based Approach

Contact Info

Product

Resources

About