Changes between Version 7 and Version 8 of Bibliography


Ignore:
Timestamp:
Jun 18, 2008, 11:00:31 AM (10 years ago)
Author:
Christina Jansen
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Bibliography

    v7 v8  
    1010
    1111==== 2008 ====
    12  * Ivan Zapreev. Model Checking Markov Chains: Techniques and Tools. PhD Thesis, University of Twente, The Netherlands, 2008. [attachment:Zapreev_PhD08.pdf PDF] [attachment:Zapreev_PhD08.bib BibTex]
     12 * Ivan Zapreev. Model Checking Markov Chains: Techniques and Tools. PhD Thesis, University of Twente, The Netherlands, 2008. [attachment: PDF] [attachment: BibTex]
    1313
    1414==== 2007 ====
    15  * David N. Jansen, Joost-Pieter Katoen, Marcel Oldenkamp, Marioelle Stoelinga and Ivan Zapreev. How Fast and Fat Is Your Probabilistic Model Checker? In Haifa Verification Conference (HVC), 2007. [attachment:JansenKOSZ_HVC07.pdf PDF] [attachment:JansenKOSZ_HVC07.bib BibTex] [attachment:JansenKOSZ_HVC07.pps PPT]
    16  * Joost-Pieter Katoen, Tim Kemna, Ivan Zapreev and David N. Jansen. Bisimulation minimisation mostly speeds up probabilistic model checking. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2007. [attachment:KatoenKZJ_TACAS07.pdf PDF] [attachment:KatoenKZJ_TACAS07.bib BibTex] [attachment:tacas_2007_03_26.pdf PPT]
     15 * David N. Jansen, Joost-Pieter Katoen, Marcel Oldenkamp, Marioelle Stoelinga and Ivan Zapreev. How Fast and Fat Is Your Probabilistic Model Checker? In Haifa Verification Conference (HVC), 2007. [attachment: PDF] [attachment: BibTex] [attachment: PPT]
     16 * Joost-Pieter Katoen, Tim Kemna, Ivan Zapreev and David N. Jansen. Bisimulation minimisation mostly speeds up probabilistic model checking. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2007. [attachment: PDF] [attachment: BibTex] [attachment: PPT]
    1717
    1818==== 2006 ====
    19  * J.-P. Katoen and I. S. Zapreev. Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability. In Quantitative Evaluation of Systems (QEST), pages 301-310, 2006. [attachment:KatoenZ_QEST06.pdf PDF] [attachment:KatoenZ_QEST06.bib BibTex] [attachment:KatoenZ_QEST06_pre.pdf PPT]
     19 * J.-P. Katoen and I. S. Zapreev. Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability. In Quantitative Evaluation of Systems (QEST), pages 301-310, 2006. [attachment: PDF] [attachment: BibTex] [attachment: PPT]
    2020
    2121==== 2005 ====
    22  * J.-P. Katoen and I. S. Zapreev. Safe on-the-fly steady-state detection for time-bounded reachability. Technical Report TR-CTIT-05-52, CTIT, University of Twente, 2005. [attachment:KatoenZ_CTIT05_52.pdf PDF] [attachment:KatoenZ_CTIT05_52.bib BibTex]
    23  * J.-P. Katoen, M. Khattri, and I. S. Zapreev. A Markov reward model checker. In Quantitative Evaluation of Systems (QEST), pages 243-244, 2005. [attachment:KatoenKZ_QEST05.pdf PDF] [attachment:KatoenKZ_QEST05.bib BibTex] [attachment:KatoenKZ_QEST05_pre.pdf PPT]
     22 * J.-P. Katoen and I. S. Zapreev. Safe on-the-fly steady-state detection for time-bounded reachability. Technical Report TR-CTIT-05-52, CTIT, University of Twente, 2005. [attachment: PDF] [attachment: BibTex]
     23 * J.-P. Katoen, M. Khattri, and I. S. Zapreev. A Markov reward model checker. In Quantitative Evaluation of Systems (QEST), pages 243-244, 2005. [attachment: PDF] [attachment: BibTex] [attachment: PPT]
    2424
    2525=== Related publications ===
    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:ClothKKP_DSN05.bib 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. [attachment: 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: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. [attachment: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. [attachment:HermansKMS_IJSTTT03.bib 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. [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]
    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:HaverkortCHKB_DSN02.bib 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. [attachment: 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: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.[attachment:BaierHHK_ICALP00.bib 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. [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]
    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:QureshiS_ISFTC96.bib 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. [attachment: BibTex]