1. C. Baier, J.P. Katoen, H. Hermanns, Approximate symbolic model checking of continuous-time Markov chains, in: Proceedings of the Concurrency Theory (CONCUR’99), Lecture Notes in Computer Science, vol. 1664, Springer, Berlin, 1999, pp. 146–162.
2. A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time;Bernardo;Theoret. Comput. Sci.,1998
3. G. Bolch, S. Greiner, H. de Meer, K.S. Trivedi, Queueing Networks and Markov Chains, Wiley, New York, 1998.
4. M. Bozga, O. Maler, On the representation of probabilities over structured domains, in: Proceedings of the International Conference on Computer Aided Verification (CAV’99), Lecture Notes in Computer Science, vol. 1633, Springer, Berlin, 1999, pp. 261–273.
5. P. Buchholz, Markovian process algebra: composition and equivalence, in: U. Herzog, M. Rettelbach (Eds.), Proceedings of the Second Workshop on Process Algebras and Performance Modelling, Arbeitsberichte des IMMD, University of Erlangen, no. 27, 1994, pp. 11–30.