Publications

Search results for wp1 [Reset Search]

2015

M. D. Lee and E. P. de Vink, “Rooted branching bisimulation as a congruence for probabilistic transition systems”, in {\rm Proceedings Thirteenth Workshop on} Quantitative Aspects of Programming Languages and Systems, {\rm London, UK, 11th-12th April 2015}, vol. 194, N. Bertrand and M. Tribastone, Eds. 2015, p. 79-94.

J. Krčál and P. Krcál, “Scalable Analysis of Fault Trees with Dynamic Features”, in 45th Annual {IEEE/IFIP} International Conference on Dependable Systems and Networks, {DSN} 2015, Rio de Janeiro, Brazil, June 22-25, 2015, 2015.

P. R. D'Argenio, A. Legay, S. Sedwards, and L. - M. Traonouez, “Smart sampling for lightweight verification of Markov decision processes”, {STTT}, vol. 17, p. 469–484, 2015.

P. R. D'Argenio, M. D. Lee, and D. Gebler, “{SOS} rule formats for convex and abstract probabilistic bisimulations”, in Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, and 12th Workshop on Structural Operational Semantics, {EXPRESS/SOS} 2015, Madrid, Spain, 31st August 2015., vol. 190, S. Crafa and D. Gebler, Eds. 2015, p. 31–45.

A. Hartmanns and M. Timmer, “Sound statistical model checking for {MDP} using partial order and confluence reduction”, {STTT}, vol. 17, p. 429–456, 2015.

2014

N. Jansen, et al., “Accelerating Parametric Probabilistic Verification”, in Quantitative Evaluation of Systems (QEST'14), 2014.

D. Guck, H. Hatefi, H. Hermanns, J. - P. Katoen, and M. Timmer, “Analysis of Timed and Long-Run Objectives for Markov Automata”, Logical Methods in Computer Science, vol. 10, 2014.

J. Klein, D. Müller, C. Baier, and S. Klüppelholz, “Are Good-for-Games Automata Good for Probabilistic Model Checking?”, in Proc. of the 8th International Conference on Language and Automata Theory and Applications (LATA), 2014.

P. R. D'Argenio, D. Gebler, and M. D. Lee, “Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules”, in Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, 2014.

L. Song, L. Zhang, and J. C. Godskesen, “Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes”, in Verification, Model Checking, and Abstract Interpretation - 15th International Conference, {VMCAI} 2014, San Diego, CA, USA, January 19-21, 2014, Proceedings, 2014.

C. Baier, J. Klein, S. Klüppelholz, and S. Märcker, “Computing Conditional Probabilities in Markovian Models Efficiently”, in Proc. of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2014.

A. Turrini and H. Hermanns, “Cost Preserving Bisimulations for Probabilistic Automata”, Logical Methods in Computer Science, vol. 10, 2014.

L. Korenciak, J. Krčál, and V. Rehák, “Dealing with Zero Density Using Piecewise Phase-Type Approximation”, in Computer Performance Engineering - 11th European Workshop, {EPEW} 2014, Florence, Italy, September 11-12, 2014. Proceedings, 2014.

S. Giro, P. R. D'Argenio, and L. M. Ferrer Fioriti, “Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms”, Theoretical Computer Science, vol. 538, p. 84-102, 2014.

C. Baier, C. Dubslaff, S. Klüppelholz, and L. Leuschner, “Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checking”, in Proc. of the 35th Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS), 2014.

C. Baier, M. Daum, C. Dubslaff, J. Klein, and S. Klüppelholz, “Energy-Utility Quantiles”, in Proc. of the 6th NASA Formal Methods Symposium (NFM), 2014.

C. Dehnert, N. Jansen, R. Wimmer, E. Ábrahám, and J. - P. Katoen, “Fast Debugging of PRISM Models”, in Int. Symp. on Automated Technology for Verification and Analysis (ATVA'14), 2014.

A. Wijs, J. - P. Katoen, and D. Bosnacki, “GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components”, in CAV, 2014.

L. Song, L. Zhang, H. Hermanns, and J. C. Godskesen, “Incremental Bisimulation Abstraction Refinement”, ACM Trans. Embed. Comput. Syst., vol. 13, p. 142:1–142:23, 2014.

L. Song, L. Zhang, H. Hermanns, and J. C. Godskesen, “Incremental Bisimulation Abstraction Refinement”, {ACM} Trans. Embedded Comput. Syst., vol. 13, p. 142:1–142:23, 2014.

B. Braitling, L. M. Ferrer Fioriti, H. Hatefi, R. Wimmer, B. Becker, and H. Hermanns, “MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata”, in Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems, {QAPL} 2014, Grenoble, France, 12-13 April 2014., 2014.

R. Wimmer, N. Jansen, E. Ábrahám, J. - P. Katoen, and B. Becker, “Minimal counterexamples for linear-time probabilistic verification”, Theoretical Computer Science, vol. 549, p. 61 - 100, 2014.

J. - P. Katoen, “Model Checking Gigantic Markov Models”, in 12th International Conference on Software Engineering and Formal Methods (SEFM), 2014.

A. Graf{-}Brill, H. Hermanns, and H. Garavel, “A Model-Based Certification Framework for the EnergyBus Standard”, in Formal Techniques for Distributed Objects, Components, and Systems, 2014.

D. Guck, M. Timmer, H. Hatefi, E. Ruijters, and M. Stoelinga, “Modelling and Analysis of Markov Reward Automata”, in Automated Technology for Verification and Analysis - 12th International Symposium, {ATVA} 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings, 2014.

Pages