Model Checking CTL is Almost Always Inherently Sequential


The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004).For all these fragments, except for the… (More)
DOI: 10.2168/LMCS-7(2:12)2011

2 Figures and Tables


  • Presentations referencing similar topics