1. Modelling with Generalized Stochastic Petri Nets;Ajmone Marsan,1995
2. C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen, On the logical characterisation of performability properties, Proc. 27th Internat. Colloq. on Automata, Languages and Programming (ICALP ’00), Lecture Notes in Computer Science, Vol. 1853, Geneve, Switzerland, 2000, pp. 780–792.
3. C. Baier, J.-P. Katoen, H. Hermanns, Approximate symbolic model checking of continuous time Markov chains, Proc. 10th Internat. Conf. on Concurrency Theory (CONCUR ’00), Lecture Notes in Computer Science, Vol. 1664, Eindhoven, The Netherlands, 1999, pp. 146–162.
4. M. Bernardo, An algebra-based method to associate rewards with EMPA terms, Proc. 24th Internat. Colloq. on Automata, Languages and Programming (ICALP ’97), Lecture Notes in Computer Science, Vol. 1256, Bologna, Italy, 1997, pp. 358–368.
5. M. Bernardo, Theory and application of extended Markovian process algebra, Ph.D. Thesis, University of Bologna, Italy, 1999 (http://www.di.unito.it/∼bernardo/).