@article{10.1109/QEST.2009.9,
    Address = {Los Alamitos, CA, USA},
    Author = {Klink, Daniel and Remke, Anne and Haverkort, Boudewijn R. and Katoen, Joost-Pieter},
    File = {Time-Bounded Reachability in Tree-Structured QBDs by Abstraction - Klink, Remke, Haverkort, Katoen (0) (0) - a - a - c.pdf},
    ISBN = {978-0-7695-3808-2},
    Journal = {Quantitative Evaluation of Systems, International Conference on},
    Keywords = {continuous-time markov chains and probabilistic model checking and probabilistic pushdown automata},
    Pages = {133-142},
    Publisher = {IEEE Computer Society},
    Title = {Time-Bounded Reachability in Tree-Structured QBDs by Abstraction},
    Volume = {0},
    Year = {2009},
    bdsk-url-1 = {http://doi.ieeecomputersociety.org/10.1109/QEST.2009.9},
    date-added = {2012-12-07 11:15:08 +0000},
    date-modified = {2012-12-08 10:41:47 +0000},
    doi = {10.1109/QEST.2009.9}
}

@article{10.1109/QEST.2009.9, Address = {Los Alamitos, CA, USA}, Author = {Klink, Daniel and Remke, Anne and Haverkort, Boudewijn R. and Katoen, Joost-Pieter}, File = {Time-Bounded Reachability in Tree-Structured QBDs by Abstraction - Klink, Remke, Haverkort, Katoen (0) (0) - a - a - c.pdf}, ISBN = {978-0-7695-3808-2}, Journal = {Quantitative Evaluation of Systems, International Conference on}, Keywords = {continuous-time markov chains and probabilistic model checking and probabilistic pushdown automata}, Pages = {133-142}, Publisher = {IEEE Computer Society}, Title = {Time-Bounded Reachability in Tree-Structured QBDs by Abstraction}, Volume = {0}, Year = {2009}, bdsk-url-1 = {http://doi.ieeecomputersociety.org/10.1109/QEST.2009.9}, date-added = {2012-12-07 11:15:08 +0000}, date-modified = {2012-12-08 10:41:47 +0000}, doi = {10.1109/QEST.2009.9} }

Library Size: 13G (12941 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge