On the Hybrid Extension of CTL and CTL+

Details On the Hybrid Extension of CTL and CTL+ On the Hybrid Extension of CTL and CTL+

2009-06-14

arxiv.org/abs/0906.2541v1

Computer Science

Logic in Computer Science

Scientific paper

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H1CTL+ and H1CTL, the hybrid extensions with one variable of CTL+ and CTL, respectively, are expressively equivalent but H1CTL+ is exponentially more succinct than H1CTL. On the other hand, HCTL+, the hybrid extension of CTL with arbitrarily many variables does not capture CTL*, as it even cannot express the simple CTL* property EGFp. The satisfiability problem for H1CTL+ is complete for triply exponential time, this remains true for quite weak fragments and quite strong extensions of the logic.

Affiliated with

Also associated with

No associations

Rating

On the Hybrid Extension of CTL and CTL+ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Hybrid Extension of CTL and CTL+, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Hybrid Extension of CTL and CTL+ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-341907