1. Bjørner, N.: Linear quantifier elimination as an abstract decision procedure. In: The 6th International Joint Conference on Automated Reasoning, IJCAR. Lecture Notes in Computer Science, vol. 6173, pp. 316–330. Springer, Heidelberg (2010)
2. Bolander, T., Hansen, J., Hansen, M.R.: Decidability of a hybrid Duration Calculus. Electron. Notes Theor. Comput. Sci. 174, 113–133 (2007)
3. Bouajjani, A., Lakhnech, Y., Robbana, R.: From Duration Calculus to linear hybrid automata. In: 7th International Conference on Computer Aided Verification, CAV. Lecture Notes in Computer Science, vol. 939, pp. 196–210. Springer, Heidelberg (1995)
4. Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: Right propositional neighborhood logic over natural numbers with integer constraints for interval lengths. In: 7th IEEE International Conference on Software Engineering and Formal Methods, SEFM, pp. 240–249. IEEE Computer Society Press, Los Alamitos (2009)
5. Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: The dark side of interval temporal logic: sharpening the undecidability border. In: 18th International Symposium on Temporal Representation and Reasoning, TIME, pp. 131–138. IEEE Press, Piscataway (2011)