1. Araki, T., Sugiyama, Y., Kasami, T.: Complexity of the deadlock avoidance problem. In: 2nd IBM Symposium on Mathematical Foundations of Computer Science, pp. 229–257 (1971)
2. Aswathanarayana, T., Subramonian, V., Niehaus, D., Gill, C.: Design and performance of configurable endsystem scheduling mechanisms. In: Proceedings of 11th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS (2005)
3. Banaszak, Z.A., Krogh, B.H.: Deadlock avoidance in exible manufacturing systems with concurrently competing processow. IEEE Transactions on Robotics and Automation 6(6), 724–734 (1990)
4. Center for Distributed Object Computing. nORB–Special Purpose Middleware for Networked Embedded Systems. Washington University, http://deuce.doc.wustl.edu/nORB/
5. Dijkstra, E.W.: Cooperating sequential processes. Technical Report EWD 123, Technological University, Eindhoven, the Netherlands (1965)