Changes between Version 9 and Version 10 of Bibliography


Ignore:
Timestamp:
Jun 19, 2008, 12:22:32 PM (10 years ago)
Author:
Christina Jansen
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Bibliography

    v9 v10  
    2626
    2727==== 2005 ====
    28  * L. Cloth, J.-P. Katoen, M. Khattri, and R. Pulungan. Model checking Markov reward models with impulse rewards. In DSN '05: Proceedings of the 6th International Conference on Dependable Systems and Networks, Yokohama, Japan, 2005. [attachment: BibTex]
     28 * L. Cloth, J.-P. Katoen, M. Khattri, and R. Pulungan. Model checking Markov reward models with impulse rewards. In DSN '05: Proceedings of the 6th International Conference on Dependable Systems and Networks, Yokohama, Japan, 2005. [http://www.mrmc-tool.org/downloads/BibTex/ClothKKP_DSN05.bib BibTex]
    2929
    3030==== 2003 ====
    31  * S. Andova, H. Hermanns, and J.-P. Katoen. Discrete-time rewards model-checked. In Formal Modeling and Analysis of Timed Systems (FORMATS 2003), Marseille, France, 2003. Lecture Notes in Computer Science, Springer-Verlag. [attachment: BibTex]
    32  * C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov Chains. IEEE Transactions on Software Engineering, 29(7), 2003. [attachment: BibTex]
    33  * H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A tool for model-checking Markov Chains. Int. Journal on Software Tools for Technology Transfer, 4(2):153-172, 2003. [attachment: BibTex]
     31 * S. Andova, H. Hermanns, and J.-P. Katoen. Discrete-time rewards model-checked. In Formal Modeling and Analysis of Timed Systems (FORMATS 2003), Marseille, France, 2003. Lecture Notes in Computer Science, Springer-Verlag. [http://www.mrmc-tool.org/downloads/BibTex/AndovaHK_FORMATS03.bib BibTex]
     32 * C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov Chains. IEEE Transactions on Software Engineering, 29(7), 2003. [http://www.mrmc-tool.org/downloads/BibTex/BaierHHK_TSE03.bib BibTex]
     33 * H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A tool for model-checking Markov Chains. Int. Journal on Software Tools for Technology Transfer, 4(2):153-172, 2003. [http://www.mrmc-tool.org/downloads/BibTex/HermansKMS_IJSTTT03.bib BibTex]
    3434
    3535==== 2002 ====
    36  * B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model-checking performability properties. In International Conference on Dependable Systems and Networks (DSN), pages 103-112. IEEE CS Press, 2002. [attachment: BibTex]
     36 * B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model-checking performability properties. In International Conference on Dependable Systems and Networks (DSN), pages 103-112. IEEE CS Press, 2002. [http://www.mrmc-tool.org/downloads/BibTex/HaverkortCHKB_DSN02.bib BibTex]
    3737
    3838==== 2000 ====
    39  * H. C. Tijms and R. Veldman. A fast algorithm for the transient reward distribution in continuous-time Markov chains. Oper. Res. Lett., 26:155-158, 2000. [attachment: BibTex]
    40  * C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. On the Logical Characterisation of Performability Properties. In ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 780-792, London, UK, 2000. Springer-Verlag.[attachment: BibTex]
     39 * H. C. Tijms and R. Veldman. A fast algorithm for the transient reward distribution in continuous-time Markov chains. Oper. Res. Lett., 26:155-158, 2000. [http://www.mrmc-tool.org/downloads/BibTex/TijmsV_99.bib BibTex]
     40 * C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. On the Logical Characterisation of Performability Properties. In ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 780-792, London, UK, 2000. Springer-Verlag.[http://www.mrmc-tool.org/downloads/BibTex/BaierHHK_ICALP00.bib BibTex]
    4141
    4242==== 1996 ====
    43  * M. A. Qureshi and W. H. Sanders. A New Methodology for Calculating Distributions of Reward Accumulated During a Finite Interval. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing, pages 116-125, Sendai, Japan, 1996. [attachment: BibTex]     
     43 * M. A. Qureshi and W. H. Sanders. A New Methodology for Calculating Distributions of Reward Accumulated During a Finite Interval. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing, pages 116-125, Sendai, Japan, 1996. [http://www.mrmc-tool.org/downloads/BibTex/QureshiS_ISFTC96.bib BibTex]