Abstract
The theoretical complexity of CTL*, CTL and LTL model checking over finite partial order traces are studied. CTL* and CTL model checking are PSPACE-complete and that the LTL model checking is coNP-complete. Since CTL is a fragment of CTL*, it implies that the problem for CTL* is also PSPACE-hard. Then, it is showed that, for CTL*, the problem is in PSPACE. Again, since CTL is a fragment of CTL*, it follows that the problem for CTL is also in PSPACE. Those results allow to conclude that for CTL* and CTL, the model checking problem is PSPACE-complete. Several theorems and model checking have been used to prove this complexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
