1. Alur, R., & Dill, D. L. (1994). A theory of timed automata. Theoretical Computer Science, 126(2), 183–235.
2. Baier, C., & Kwiatkowska, M. (1998). Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3), 125–155.
3. Ballarini, P., Djafri, H., Duflot, M., Haddad, S., & Pekergin, N. (2011). Petri nets compositional modeling and verification of Flexible Manufacturing Systems. In IEEE International Conference on Automation Science and Engineering, pp. 588–593. New York: IEEE.
4. Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.
5. Billaut, J.-C., Moukrim, A., & Sanlaville, E. (2013). Flexibility and robustness in scheduling. London: Wiley.