Concurrency Column for the June 2007 Issue of the BEATCS

I have just posted the concurrency column for the June 2007 issue of the Bulletin of the EATCS.
In this piece, Orna Kupferman, who is one of the prime movers in the study of automata-theoretic constructions and in their application to the verification of reactive systems, presents a survey of several automata-theoretic problems in which the gap between the known upper and lower complexity bounds is exponential, and describes recent efforts to close the gaps.

I am glad to be able to offer this piece to the readership of the concurrency column and of this blog, and I trust that you will enjoy reading it as much as I did.