Reference:

J. Esparza and A. Kiehn. On the model checking problem for branching time logics and basic parallel processes. In Proc. of CAV'95, number 939 in Lecture Notes in Computer Science, pages 353–366. Springer-Verlag, 1995.

Abstract:

We investigate the model checking problem for branching time logics and Basic Parallel Processes. We show that the problem is undecidable for a logic equivalent to CTL* in the usual interleaving semantics, but decidable in a standard partial order interpretation.

Suggested BibTeX entry:

@inproceedings{EK95,
    author = {J. Esparza and A. Kiehn},
    booktitle = {Proc. of CAV'95},
    number = {939},
    pages = {353--366},
    publisher = {{Springer-Verlag}},
    series = {{Lecture Notes in Computer Science}},
    title = {On the model checking problem for branching time logics and Basic Parallel Processes},
    year = {1995}
}