Publications
Search results for wp1 [Reset Search]
“CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings”, Lecture Notes in Computer Science, vol. 8052. 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)
, “ 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.
, “ 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.
, “ On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation”, {ECEASST}, vol. 66, 2013.
, ““Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings”, FORMATS, vol. 8053. 2013.
High-Level Counterexamples for Probabilistic Automata”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 39-54.
, “ 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.
, “ 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.
, “ Modular Semantics for Transition System Specifications with Negative Premises”, in CONCUR 2013 – Concurrency Theory, 2013, vol. 8052, p. 46-60.
, “ On-the-Fly Confluence Detection for Statistical Model Checking”, in NASA Formal Methods, 5th International Symposium, NFM 2013, Moffett Field, CA, USA, May 14-16, 2013. Proceedings, 2013.
, “ Prinsys - On a Quest for Probabilistic Loop Invariants”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 193-208.
, “ A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-Select”, in NASA Formal Methods, 5th Symposium, NFM13, 2013, vol. 7871, p. 307-321.
, “ Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata”, in Algebraic Informatics, 5th International Conference, CAI13, 2013, vol. 8080, p. 4-5.
, ““Quantitative Evaluation of Systems - 10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings”, Lecture Notes in Computer Science, vol. 8054. 2013.
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.
, “ Revisiting Weak Simulation for Substochastic Markov Chains”, in Quantitative Evaluation of Systems - 10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, 2013, vol. 8054, p. 209-224.
, “ 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)
, “