2016
DOI: 10.31341/jios.40.1.7
|View full text |Cite
|
Sign up to set email alerts
|

The Investigation of TLC Model Checker Properties

Abstract: This paper presents the investigation and comparison of TLC model checking method (TLA Checker) properties. There are two different approaches to method usage which are considered. The first one consists of a transition system states attendance by breadth-first search (BFS), and the second one by depth-first search (DFS). The Kripke structure has been chosen as a transition system model. A case study has been conducted, where composite web service usage scenario has been considered. Obtained experimental resul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 11 publications
1
4
0
Order By: Relevance
“…In the Table 1, it can be seen that the implementation of the TLC method has appeared to be significantly more effective in terms of the related computational expenses, when comparing to the default BFS alternative: from about 1.902 times (for ). It does correspond to the results obtained previously [6,23], and it can be considered as a significantly viable argument in favor of the DFS implementation when the iterative approach to verification takes place [24]. On the contrary, when addressing the spatial properties of the model checking task resolved with a particular TLC implementation, the picture changes drastically -in terms of the ratio between the numbers of transition system states generated (  BFS S and…”
supporting
confidence: 76%
See 2 more Smart Citations
“…In the Table 1, it can be seen that the implementation of the TLC method has appeared to be significantly more effective in terms of the related computational expenses, when comparing to the default BFS alternative: from about 1.902 times (for ). It does correspond to the results obtained previously [6,23], and it can be considered as a significantly viable argument in favor of the DFS implementation when the iterative approach to verification takes place [24]. On the contrary, when addressing the spatial properties of the model checking task resolved with a particular TLC implementation, the picture changes drastically -in terms of the ratio between the numbers of transition system states generated (  BFS S and…”
supporting
confidence: 76%
“…Results of previous experimentations have shown, that, depending on the architectural plane of specification, there is a bound, in terms of the number of state variables, when certain TLC implementation is more efficient in terms of the corresponding computational expenses [6,23].…”
Section: Experimentation and Obtained Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…It has been shown previously that, because of the exponential growth of state space, the limitation of computational and time resources can be faced [17]. More or less, these expenses can be diminished -by choosing the right way of model checking method implementation, e.g., the Depth-first Search-based approach over the Breadth-first Search-based one [18]. Nevertheless, the verification-related computations are directly dependent on the complexity of formal models, and, because of the exponential growth of state space, can be overabundant and/or inexpedient.…”
Section: Related Workmentioning
confidence: 99%
“…The template of TLA+ specification is given in [22]. The corresponding verification-related time costs and computational expenses are covered in [17] and [18].…”
Section: Approach and Case Studymentioning
confidence: 99%