Publications
Filters: Author is Joost-Pieter Katoen [Clear All Filters]
A Greedy Approach for the Efficient Repair of Stochastic Models”, in {NASA} Formal Methods - 7th International Symposium, {NFM} 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings, 2015.
, “ On the Hardness of Almost-Sure Termination”, in Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {I}, 2015.
, “ High-level Counterexamples for Probabilistic Automata”, Logical Methods in Computer Science, vol. 11, 2015.
, “ Modelling and statistical model checking of a microgrid”, {STTT}, vol. 17, p. 537–554, 2015.
, “ Probabilistic Programming: {A} True Verification Challenge”, in Automated Technology for Verification and Analysis - 13th International Symposium, {ATVA} 2015, Shanghai, China, October 12-15, 2015, Proceedings, 2015.
, “ Accelerating Parametric Probabilistic Verification”, in Quantitative Evaluation of Systems (QEST'14), 2014.
, “ Analysis of Timed and Long-Run Objectives for Markov Automata”, Logical Methods in Computer Science, vol. 10, 2014.
, “ Fast Debugging of PRISM Models”, in Int. Symp. on Automated Technology for Verification and Analysis (ATVA'14), 2014.
, “ , “ Minimal counterexamples for linear-time probabilistic verification”, Theoretical Computer Science, vol. 549, p. 61 - 100, 2014.
, “ Model Checking Gigantic Markov Models”, in 12th International Conference on Software Engineering and Formal Methods (SEFM), 2014.
, “ Parametric LTL on Markov Chains”, in IFIP Conference on Theoretical Computer Science (TCS), 2014.
, “ Probably Safe or Live”, in Computer Science Logic and Logic in Computer Science (CSL-LICS), 2014.
, “ Symbolic counterexample generation for large discrete-time Markov chains”, Sci. Comput. Program., vol. 91, p. 90-114, 2014.
, “ Tight Game Abstractions of Probabilistic Automata”, in Concurrency Theory (CONCUR), 2014.
, “ Abstract Probabilistic Automata”, Information and Computation, vol. 232, p. 66 - 116, 2013.
, “ A compositional modelling and analysis framework for stochastic hybrid systems”, Formal Methods in System Design, vol. 43, p. 191-232, 2013.
, “ Concurrency Meets Probability: Theory and Practice - (Abstract)”, in CONCUR 2013 – Concurrency Theory, 2013, vol. 8052, p. 44-45.concur_2013_katoen.pdf (103.79 KB)
, “ High-Level Counterexamples for Probabilistic Automata”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 39-54.
, “ Model checking for performability”, Mathematical Structures in Computer Science, vol. 23, p. 751–795, 2013.
, “ Model Checking Meets Probability: A Gentle Introduction”, in Engineering Dependable Software Systems, vol. 34, Amsterdam: , 2013, p. 177–205.
, “ Modelling and Statistical Model Checking of a Microgrid”, in Workshop on Statistical Model Checking (SMC), 2013.
, “ Modelling, Reduction and Analysis of Markov Automata”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 55-71.
, “ Prinsys - On a Quest for Probabilistic Loop Invariants”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 193-208.
, “ A Semantics for Every GSPN”, in Petri Nets 2013, 2013, vol. 7927, p. 90–109.79270090.pdf (355.81 KB)
, “