This paper describes adding priority ceilings to our earlier work on semantic concurrency control. This extension eliminates deadlock, bounds priority inversion, and is simpler to implement than our original semantic concurrency control technique. A version of this paper appears in the Proceedings of the First International Workshop on Real-Time Databases, March 1996.