Publications
Filters: Author is Holger Hermanns [Clear All Filters]
, “On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation”, {ECEASST}, vol. 66, 2013.
, “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.
, “Incremental Bisimulation Abstraction Refinement”, in Application of Concurrency to System Design (ACSD), 2013 13th International Conference on, 2013, p. 11-20.
, “An Internet Inspired Approach to Power Grid Stability”, it - Information Technology, vol. 55, no. 2, p. 45-51, 2013.
, “Model checking for performability”, Mathematical Structures in Computer Science, vol. 23, p. 751–795, 2013.
, “Modelling, Reduction and Analysis of Markov Automata”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 55-71.
, “The Quest for Minimal Quotients for Probabilistic Automata”, in Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, 2013, vol. 7795, p. 16-31.
, “Rewarding probabilistic hybrid automata”, in Proceedings of the 16th international conference on Hybrid systems: computation and control, HSCC 2013, April 8-11, 2013, Philadelphia, PA, USA, 2013.
, “A Semantics for Every GSPN”, in Petri Nets 2013, 2013, vol. 7927, p. 90–109.
79270090.pdf (355.81 KB)
79270090.pdf (355.81 KB) , “A comparative analysis of decentralized power grid stabilization strategies”, in Proceedings of the Winter Simulation Conference, 2012.
, “A Compositional Modeling and Analysis Framework for Stochastic Hybrid Systems”, Formal Methods in System Design, 2012.fmsd2012_final.pdf (1.77 MB)
fmsd2012_final.pdf (1.77 MB) , “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.
, “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.
, “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.
, “Model Checking Algorithms for Markov Automata”, ECEASST, vol. 53, 2012.
, “Modelling and Decentralised Runtime Control of Self-stabilising Power Micro Grids”, in Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012, Proceedings, Part I, 2012, vol. 7609, p. 420-439.
, “Simulation and Statistical Model Checking for Modestly Nondeterministic Models”, in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012, vol. 7201, p. 249-252.
, “State-of-the-art tools and techniques for quantitative modeling and analysis of embedded systems”, in 2012 Design, Automation {&} Test in Europe Conference {&} Exhibition, DATE 2012, Dresden, Germany, March 12-16, 2012, 2012.
, “Variable Probabilistic Abstraction Refinement”, in Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, 2012, vol. 7561, p. 300-316.
, “Verification of Open Interactive Markov Chains”, in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, 2012.
, “Automata-Based CSL Model Checking”, Logical Methods in Computer Science, vol. 8, 2011.1104.4983.pdf (230.89 KB)
1104.4983.pdf (230.89 KB)
