Publications

Export 46 results:
Sort by: Author [ Title (Asc)] Type Year
Filters: Author is Holger Hermanns  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
A
B. Braitling, L. M. Ferrer Fioriti, H. Hatefi, R. Wimmer, B. Becker, and H. Hermanns, “Abstraction-Based Computation of Reward Measures for Markov Automata”, in Verification, Model Checking, and Abstract Interpretation - 16th International Conference, {VMCAI} 2015, Mumbai, India, January 12-14, 2015. Proceedings, 2015.
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.
L. Zhang, D. N. Jansen, F. Nielson, and H. Hermanns, “Automata-Based CSL Model Checking”, Logical Methods in Computer Science, vol. 8, 2011.PDF icon 1104.4983.pdf (230.89 KB)
C
A. Hartmanns, H. Hermanns, and P. Berrang, “A comparative analysis of decentralized power grid stabilization strategies”, in Proceedings of the Winter Simulation Conference, 2012.
E. M. Hahn, A. Hartmanns, H. Hermanns, and J. - P. Katoen, “A Compositional Modeling and Analysis Framework for Stochastic Hybrid Systems”, Formal Methods in System Design, 2012.PDF icon fmsd2012_final.pdf (1.77 MB)
E. M. Hahn, A. Hartmanns, H. Hermanns, and J. - P. Katoen, “A compositional modelling and analysis framework for stochastic hybrid systems”, Formal Methods in System Design, vol. 43, p. 191-232, 2013.
H. Hermanns, J. Krčál, and J. Kret\'ınský, “Compositional Verification and Optimization of Interactive Markov Chains”, in CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, Buenos Aires, 2013.
R. Pulungan and H. Hermanns, “A construction and minimization service for continuous probability distributions”, {STTT}, vol. 17, p. 77–90, 2015.
H. Hermanns and A. Turrini, “Cost Preserving Bisimulations for Probabilistic Automata”, in CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, 2013, vol. 8052, p. 349-363.
A. Turrini and H. Hermanns, “Cost Preserving Bisimulations for Probabilistic Automata”, Logical Methods in Computer Science, vol. 10, 2014.
D
C. Eisentraut, H. Hermanns, J. Krämer, A. Turrini, and L. Zhang, “Deciding Bisimilarities on Distributions”, in Quantitative Evaluation of Systems - 10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, 2013, vol. 8054, p. 72-88.
H. Hermanns and A. Turrini, “Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time”, in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, 2012, vol. 18, p. 435-447.
H
L. M. Ferrer Fioriti and H. Hermanns, “Heuristics for Probabilistic Timed Automata with Abstraction Refinement”, in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012, vol. 7201, p. 151-165.
I
H. Hatefi and H. Hermanns, “Improving Time Bounded Reachability Computations in Interactive Markov Chains”, in Fundamentals of Software Engineering - 5th International Conference, FSEN 2013, Tehran, Iran, April 24-26, 2013, Revised Selected Papers, 2013.
L. Song, L. Zhang, H. Hermanns, and J. C. Godskesen, “Incremental Bisimulation Abstraction Refinement”, in Application of Concurrency to System Design (ACSD), 2013 13th International Conference on, 2013, p. 11-20.
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.
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.
H. Hermanns and A. Hartmanns, “An Internet Inspired Approach to Power Grid Stability”, it - Information Technology, vol. 55, no. 2, p. 45-51, 2013.
M
J. Bogdoll, A. David, A. Hartmanns, and H. Hermanns, “mctau: Bridging the Gap between Modest and UPPAAL”, in Model Checking Software - 19th International Workshop, SPIN 2012, Oxford, UK, July 23-24, 2012. Proceedings, 2012, vol. 7385, p. 227-233.
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.
H. Hatefi and H. Hermanns, “Model Checking Algorithms for Markov Automata”, ECEASST, vol. 53, 2012.
C. Baier, E. M. Hahn, B. R. Haverkort, H. Hermanns, and J. - P. Katoen, “Model checking for performability”, Mathematical Structures in Computer Science, vol. 23, p. 751–795, 2013.
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.

Pages