1. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inf., XI(2):127–168, 1986.
2. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California, pages 229–239, 1988.
3. R.N. Bol and J.F. Groote. The meaning of negative premises in transition system specifications. Report CS-R9054, CWI, Amsterdam, 1990.
4. T. Bolognesi, F. Lucidi, and S. Trigila. From timed Petri nets to timed LOTOS. In L. Logrippo, R.L. Probert, and H. Ural, editors, Proceedings of the Tenth International IFIP WG6.1 Symposium on Protocol Specification, Testing and Verification, Ottawa, 1990.
5. J. Camilleri. An operational semantics for OCCAM. International Journal of Parallel Programming, 18(5):149–167, October 1989.