This paper presents the Affected Set Priority Ceiling Protocols (ASPCP) for concurrency control in real-time object-oriented systems. These protocols are based on a combination of semantic locking and priority ceiling techniques. This paper shows that the ASPCP protocols provide higher potential concurrency for object-oriented systems than existing Priority Ceiling protocols, while still bounding priority inversion and preventing deadlock. A version of this paper appeared in the Proceedings of the The 1st IEEE International Symposium on Object-oriented Real-time distributed Computing