Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Model Checking of RegCTL

In: Computing and Informatics, vol. 25, no. 1
T. Brázdil - I. Černá

Details:

Year, pages: 2006, 81 - 97
Keywords:
Finite state system, regular expression, tree automaton, temporal logic, model checking
About article:
The paper is devoted to the problem of extending the temporal logic CTL so that it is more expressive and complicated properties can be expressed in a more readable form. The specification language RegCTL, an extension of CTL, is proposed. In RegCTL every CTL temporal operator is augmented with a regular expression, thus restricting moments when the validity is required. We propose a local distributed model checking algorithm for RegCTL
How to cite:
ISO 690:
Brázdil, T., Černá, I. 2006. Model Checking of RegCTL. In Computing and Informatics, vol. 25, no.1, pp. 81-97. 1335-9150.

APA:
Brázdil, T., Černá, I. (2006). Model Checking of RegCTL. Computing and Informatics, 25(1), 81-97. 1335-9150.