CTL and equivalent sublanguages of CTL
CHDL'97 Proceedings of the IFIP TC10 WG10.5 international conference on Hardware description languages and their applications : specification, modelling, verification and synthesis of microelectronic systems: specification, modelling, verification and synthesis of microelectronic systems
Communication and Concurrency
Proceedings of the 7th International Conference on Computer Aided Verification
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A HOL Conversion for Translating Linear Time Temporal Logic to omega-Automata
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Yet another Look at the LTL Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Introducing Mutual Exclusion in Esterel
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Making prophecies with decision predicates
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
We present an algorithm for checking CTL formulas in Kripke structures with side conditions, where the side conditions define new variables in terms of path formulas. Given any CTL formula where the defined variables may occur, the presented algorithm will determine the set of states where the CTL* formula holds that is obtained by replacing each new variable defined by a side condition by its definition.The basic idea of our algorithm is to translate each side condition to a Kripke structure that encodes precisely the definition of the new variable. After that, we compute the products of these structures with the given structure and use a generalization of the well-known CTL model checking procedure. The presented model checking procedure can still be implemented as a symbolic model checking procedure (e.g. with BDDs).We moreover show how each CTL* model checking problem can be translated efficiently to a CTL model checking problem with side conditions, and hence show that the method can be used to construct efficient CTL* and LTL model checking procedures. Moreover, it is shown that for LTL model checking, we can still use standard CTL model checking procedures instead of our generalized version.