Model Checking of RegCTL
Keywords:Finite state system, regular expression, tree automaton, temporal logic, model checking
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.
Download data is not yet available.
How to Cite
Brázdil, T., & Černá, I. (2012). Model Checking of RegCTL. COMPUTING AND INFORMATICS, 25(1), 81–97. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/334