The version in the proceedings contains a false claim saying that the
the problems of statisfiability and model checking for the logic with
the Kleene star are PSPACE-complete.

In the corrected version, we restrict the logic to its star-free
fragment. The decision problems are indeed PSPACE-complete in this
case.