10 search results - page 1 / 2 » The Common Fragment of CTL and LTL |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
TIME
2009
IEEE
13 years 11 months ago
2009
IEEE
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...
ICECCS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the µcalculus ...
ICFEM
2007
Springer
13 years 11 months ago
2007
Springer
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...