Holger Hermanns

According to our database1, Holger Hermanns
  • authored at least 224 papers between 1994 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
How Is Your Satellite Doing? Battery Kinetics with Recharging and Uncertainty.
LITES, 2017

Cost vs. time in stochastic games and Markov automata.
Formal Asp. Comput., 2017

Multi-Objective Approaches to Markov Decision Processes with Uncertain Transition Parameters.
CoRR, 2017

Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes.
CoRR, 2017

Is your software on dope? Formal analysis of surreptitiously "enhanced" programs.
CoRR, 2017

Long-Run Rewards for Markov Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes.
Proceedings of the Quantitative Evaluation of Systems - 14th International Conference, 2017

Modelling and certification for electric mobility.
Proceedings of the 15th IEEE International Conference on Industrial Informatics, 2017

Pareto Optimal Reachability Analysis for Simple Priced Timed Automata.
Proceedings of the Formal Methods and Software Engineering, 2017

Model-Based Testing for Asynchronous Systems.
Proceedings of the Critical Systems: Formal Methods and Automated Verification - Joint 22nd International Workshop on Formal Methods for Industrial Critical Systems - and, 2017

Is Your Software on Dope? - Formal Analysis of Surreptitiously "enhanced" Programs.
Proceedings of the Programming Languages and Systems, 2017

Models of Connected Things: On Priced Probabilistic Timed Reo.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

From Lotosphere to Thermosphere.
Proceedings of the ModelEd, TestEd, TrustEd, 2017

Teaching Academic Concurrency to Amazing Students.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
PTRebeca: Modeling and analysis of distributed and asynchronous systems.
Sci. Comput. Program., 2016

Deciding probabilistic automata weak bisimulation: theory and practice.
Formal Asp. Comput., 2016

Distributed Synthesis in Continuous Time.
CoRR, 2016

Compositional Reasoning for Interval Markov Decision Processes.
CoRR, 2016

Reward-Bounded Reachability Probability for Uncertain Weighted MDPs.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Probabilistic CTL*: The Deductive Way.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Effective Static and Dynamic Fault Tree Analysis.
Proceedings of the Computer Safety, Reliability, and Security, 2016

Exploiting Robust Optimization for Interval Probabilistic Bisimulation.
Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

The Value of Attack-Defence Diagrams.
Proceedings of the Principles of Security and Trust - 5th International Conference, 2016

Compositional Bisimulation Minimization for Interval Markov Decision Processes.
Proceedings of the Language and Automata Theory and Applications, 2016

Facets of Software Doping.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

My O Is Bigger Than Yours (Invited Talk).
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Distributed Synthesis in Continuous Time.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Battery-Aware Scheduling in Low Orbit: The GomX-3 Case.
Proceedings of the FM 2016: Formal Methods, 2016

Flexible support for time and costs in scenario-aware dataflow.
Proceedings of the 2016 International Conference on Embedded Software, 2016

Schedulers are no Prophets.
Proceedings of the Semantics, Logics, and Calculi, 2016

2015
Transient Reward Approximation for Continuous-Time Markov Chains.
IEEE Trans. Reliability, 2015

A construction and minimization service for continuous probability distributions.
STTT, 2015

Improving time bounded reachability computations in interactive Markov chains.
Sci. Comput. Program., 2015

In the quantitative automata zoo.
Sci. Comput. Program., 2015

Polynomial time decision algorithms for probabilistic automata.
Inf. Comput., 2015

Recharging Probably Keeps Batteries Alive.
CoRR, 2015

Explicit Model Checking of Very Large MDP using Partitioning and Secondary Storage.
CoRR, 2015

On the Control of Self-Balancing Unicycles.
Proceedings of the Proceedings Workshop on Models for Formal Analysis of Real Systems, 2015

Optimal Continuous Time Markov Decisions.
CoRR, 2015

Abstraction-Based Computation of Reward Measures for Markov Automata.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Cost vs. Time in Stochastic Games and Markov Automata.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2015

A Compression App for Continuous Probability Distributions.
Proceedings of the Quantitative Evaluation of Systems, 12th International Conference, 2015

Probabilistic Termination: Soundness, Completeness, and Compositionality.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Energieinformatik im erdnahen Orbit.
Proceedings of the 45. Jahrestagung der Gesellschaft für Informatik, Informatik 2015, Informatik, Energie und Umwelt, 28. September, 2015

Probabilistic Bisimulation for Realistic Schedulers.
Proceedings of the FM 2015: Formal Methods, 2015

Rare Event Simulation with Fully Automated Importance Splitting.
Proceedings of the Computer Performance Engineering - 12th European Workshop, 2015

Recharging Probably Keeps Batteries Alive.
Proceedings of the Cyber Physical Systems. Design, Modeling, and Evaluation, 2015

Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage.
Proceedings of the Automated Technology for Verification and Analysis, 2015

Optimal Continuous Time Markov Decisions.
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
Incremental Bisimulation Abstraction Refinement.
ACM Trans. Embedded Comput. Syst., 2014

Special Issue on "Quantitative Evaluation of SysTems" (QEST 2012).
Perform. Eval., 2014

Performance Analysis of Distributed and Asynchronous Systems using Probabilistic Timed Actors.
ECEASST, 2014

Reachability and Reward Checking for Stochastic Timed Automata.
ECEASST, 2014

Cost Preserving Bisimulations for Probabilistic Automata.
Logical Methods in Computer Science, 2014

Probabilistic Bisimulation: Naturally on Distributions.
CoRR, 2014

Analysis of Timed and Long-Run Objectives for Markov Automata.
Logical Methods in Computer Science, 2014

MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata.
Proceedings of the Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems, 2014

The Modest Toolset: An Integrated Environment for Quantitative Modelling and Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Time-Dependent Analysis of Attacks.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

A Model-Based Certification Framework for the EnergyBus Standard.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2014

Probabilistic Bisimulation: Naturally on Distributions.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Model checking for performability.
Mathematical Structures in Computer Science, 2013

An Internet Inspired Approach to Power Grid Stability.
it - Information Technology, 2013

A compositional modelling and analysis framework for stochastic hybrid systems.
Formal Methods in System Design, 2013

On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation.
ECEASST, 2013

Modelling, Reduction and Analysis of Markov Automata (extended version)
CoRR, 2013

Compositional Verification and Optimization of Interactive Markov Chains.
CoRR, 2013

The Quest for Minimal Quotients for Probabilistic Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Modelling, Reduction and Analysis of Markov Automata.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Deciding Bisimilarities on Distributions.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Rewarding probabilistic hybrid automata.
Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

Improving Time Bounded Reachability Computations in Interactive Markov Chains.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

Cost Preserving Bisimulations for Probabilistic Automata.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Compositional Verification and Optimization of Interactive Markov Chains.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

A Semantics for Every GSPN.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

Incremental Bisimulation Abstraction Refinement.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012
Safety Verification for Probabilistic Hybrid Systems.
Eur. J. Control, 2012

Model Checking Algorithms for Markov Automata.
ECEASST, 2012

Transient Reward Approximation for Grids, Crowds, and Viruses
CoRR, 2012

Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
CoRR, 2012

A comparative analysis of decentralized power grid stabilization strategies.
Proceedings of the Winter Simulation Conference, 2012

Quantitative Models for a Not So Dumb Grid.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

mctau: Bridging the Gap between Modest and UPPAAL.
Proceedings of the Model Checking Software - 19th International Workshop, 2012

Heuristics for Probabilistic Timed Automata with Abstraction Refinement.
Proceedings of the Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012

Simulation and Statistical Model Checking for Modestly Nondeterministic Models.
Proceedings of the Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012

Modelling and Decentralised Runtime Control of Self-stabilising Power Micro Grids.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Verification of Open Interactive Markov Chains.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

State-of-the-art tools and techniques for quantitative modeling and analysis of embedded systems.
Proceedings of the 2012 Design, Automation & Test in Europe Conference & Exhibition, 2012

Variable Probabilistic Abstraction Refinement.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
From Concurrency Models to Numbers - Performance and Dependability.
Proceedings of the Software and Systems Safety - Specification and Verification, 2011

Probabilistic reachability for parametric Markov models.
STTT, 2011

The ins and outs of the probabilistic model checker MRMC.
Perform. Eval., 2011

Bounding the equilibrium distribution of Markov population models.
Numerical Lin. Alg. with Applic., 2011

Probabilistic Logical Characterization.
Inf. Comput., 2011

Multi-Core Memory Models and Concurrency Theory (Dagstuhl Seminar 11011).
Dagstuhl Reports, 2011

Automata-Based CSL Model Checking
Logical Methods in Computer Science, 2011

A verifiedwireless safety critical hard real-time design.
Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

Formal Methods in Energy Informatics.
Proceedings of the Software Engineering and Formal Methods - 9th International Conference, 2011

Reachability analysis for incomplete networks of Markov decision processes.
Proceedings of the 9th IEEE/ACM International Conference on Formal Methods and Models for Codesign, 2011

Automata-Based CSL Model Checking.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Measurability and safety verification for stochastic hybrid systems.
Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, 2011

Partial Order Methods for Statistical Model Checking and Simulation.
Proceedings of the Formal Techniques for Distributed Systems, 2011

Model Checking Algorithms for CTMDPs.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

Bounded Fairness for Probabilistic Distributed Algorithms.
Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2010
Synthesis and stochastic assessment of cost-optimal schedules.
STTT, 2010

Symbolic partition refinement with automatic balancing of time and space.
Perform. Eval., 2010

Performability assessment by model checking of Markov reward models.
Formal Methods in System Design, 2010

Performance evaluation and model checking join forces.
Commun. ACM, 2010

PASS: Abstraction Refinement for Infinite Probabilistic Models.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems.
Proceedings of the QEST 2010, 2010

Superposition-Based Analysis of First-Order Probabilistic Timed Automata.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

On Probabilistic Automata in Continuous Time.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Ten Years of Performance Evaluation for Concurrent Systems Using CADP.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Quantitative system validation in model driven design.
Proceedings of the 10th International conference on Embedded software, 2010

10271 Abstracts Collection - Verification over discrete-continuous boundaries.
Proceedings of the Verification over discrete-continuous boundaries, 04.07. - 09.07.2010, 2010

Concurrency and Composition in a Stochastic World.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Safety Verification for Probabilistic Hybrid Systems.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

PARAM: A Model Checker for Parametric Markov Models.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Aggregation Ordering for Massively Compositional Models.
Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010

2009
Compositional Dependability Evaluation for STATEMATE.
IEEE Trans. Software Eng., 2009

Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains.
Fundam. Inform., 2009

Dependability Engineering of Silent Self-stabilizing Systems.
Proceedings of the Stabilization, 2009

Probabilistic Reachability for Parametric Markov Models.
Proceedings of the Model Checking Software, 2009

Acyclic Minimality by Construction---Almost.
Proceedings of the QEST 2009, 2009

The Ins and Outs of the Probabilistic Model Checker MRMC.
Proceedings of the QEST 2009, 2009

A Modest Approach to Checking Probabilistic Timed Automata.
Proceedings of the QEST 2009, 2009

FlowSim Simulation Benchmarking Platform.
Proceedings of the QEST 2009, 2009

The How and Why of Interactive Markov Chains.
Proceedings of the Formal Methods for Components and Objects - 8th International Symposium, 2009

Future Design Challenges for Electric Energy Supply.
Proceedings of 12th IEEE International Conference on Emerging Technologies and Factory Automation, 2009

INFAMY: An Infinite-State Markov Model Checker.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

Towards Performance Prediction of Compositional Models in Industrial GALS Designs.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Teaching Concurrency Concepts to Freshmen.
Trans. Petri Nets and Other Models of Concurrency, 2008

Improving the effectiveness of system verification.
STTT, 2008

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.
Logical Methods in Computer Science, 2008

Special issue: CONCUR 2006.
Inf. Comput., 2008

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
CoRR, 2008

Symbolic Partition Refinement with Dynamic Balancing of Time and Space.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

The Minimal Representation of the Maximum of Erlang Distributions.
Proceedings of the Proceedings 14th GI/ITG Conference on Measurement, Modelling and Evaluation of Computer and Communication Systems (MMB 2008), March 31, 2008

May we reach it? Or must we? In what time? With what probability?
Proceedings of the Proceedings 14th GI/ITG Conference on Measurement, Modelling and Evaluation of Computer and Communication Systems (MMB 2008), March 31, 2008

Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems.
Proceedings of the Hybrid Systems: Computation and Control, 11th International Workshop, 2008

An Experimental Evaluation of Probabilistic Simulation.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2008

Quantitative Evaluation in Embedded System Design: Validation of Multiprocessor Multithreaded Architectures.
Proceedings of the Design, Automation and Test in Europe, 2008

On the Minimisation of Acyclic Models.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Probabilistic CEGAR.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

Reachability in continuous-time Markov reward decision processes.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

Effective Minimization of Acyclic Phase-Type Representations.
Proceedings of the Analytical and Stochastic Modeling Techniques and Applications, 2008

Time-bounded model checking of infinite-state continuous-time Markov chains.
Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008

2007
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

motor: The modestTool Environment.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Probabilistic Model Checking Modulo Theories.
Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

Does Clock Precision Influence ZigBee's Energy Consumptions?.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems.
Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007

Deciding Simulations on Probabilistic Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems.
IEEE Trans. Software Eng., 2006

YMCA: - Why Markov Chain Algebra? - .
Electr. Notes Theor. Comput. Sci., 2006

Bisimulation and Simulation Relations for Markov Chains.
Electr. Notes Theor. Comput. Sci., 2006

Compositional Performability Evaluation for STATEMATE.
Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

06161 Working Groups' Report: The Challlenge of Combining Simulation and Verification.
Proceedings of the Simulation and Verification of Dynamic Systems, 17.04. - 22.04.2006, 2006

Sigref- A Symbolic Bisimulation Tool Box.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes.
Theor. Comput. Sci., 2005

QoS modelling and analysis with UML-statecharts: the StoCharts approach.
SIGMETRICS Performance Evaluation Review, 2005

Model checking meets performance evaluation.
SIGMETRICS Performance Evaluation Review, 2005

Axiomatising divergence.
Inf. Comput., 2005

Comparative branching-time semantics for Markov chains.
Inf. Comput., 2005

From StoCharts to MoDeST: a comparative reliability analysis of train radio communications.
Proceedings of the Fifth International Workshop on Software and Performance, 2005

Logic and Model Checking for Hidden Markov Models.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

Counterexamples for Timed Probabilistic Reachability.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

2004
Probabilistic weak simulation is decidable in polynomial time.
Inf. Process. Lett., 2004

Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Embedded Software Analysis with MOTOR.
Proceedings of the Formal Methods for the Design of Real-Time Systems, 2004

Dependability Checking with StoCharts: Is Train Radio Reliable Enough for Trains?
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Synthesis and Stochastic Assessment of Schedules for Lacquer Production.
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

An industrial-strength formal method -- A Modest survey.
Proceedings of the International Symposium on Leveraging Applications of Formal Methods, 2004

2003
Model-Checking Algorithms for Continuous-Time Markov Chains.
IEEE Trans. Software Eng., 2003

A tool for model-checking Markov chains.
STTT, 2003

On the use of MTBDDs for performability analysis and verification of stochastic systems.
J. Log. Algebr. Program., 2003

Optimal state-space lumping in Markov chains.
Inf. Process. Lett., 2003

A QoS-Oriented Extension of UML Statecharts.
Proceedings of the «UML» 2003, 2003

A Set of Performance and Dependability Analysis Components for CADP.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Discrete-Time Rewards Model-Checked.
Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

ETMCC: Model Checking Performability Properties of Markov Chains.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Cost-Optimization of the IPv4 Zeroconf Protocol.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

On Integrating the MÖBIUS and MODEST Modeling Tools.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

The Modest Modeling Tool and Its Implementation.
Proceedings of the Computer Performance Evaluations, 2003

Comparative Branching-Time Semantics.
Proceedings of the CONCUR 2003, 2003

2002
Process algebra for performance evaluation.
Theor. Comput. Sci., 2002

Guest editors' introduction: Model checking in a nutshell.
J. Log. Algebr. Program., 2002

Automated Performance and Dependability Evaluation Using Model Checking.
Proceedings of the Performance Evaluation of Complex Systems: Techniques and Tools, 2002

Axiomatising Divergence.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

A Probabilistic Extension of UML Statecharts.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

On Combining Functional Verification and Performance Evaluation Using CADP.
Proceedings of the FME 2002: Formal Methods, 2002

Model Checking Performability Properties.
Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002

Simulation for Continuous-Time Markov Chains.
Proceedings of the CONCUR 2002, 2002

Interactive Markov Chains: The Quest for Quantified Quality
Lecture Notes in Computer Science 2428, Springer, ISBN: 3-540-44261-8, 2002

2001
Construction and Verification of Performance and Reliability Models.
Bulletin of the EATCS, 2001

Beyond Memoryless Distributions: Model Checking Semi-Markov Chains.
Proceedings of the Process Algebra and Probabilistic Methods, 2001

MoDeST - A Modelling and Description Language for Stochastic Timed Systems.
Proceedings of the Process Algebra and Probabilistic Methods, 2001

Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains.
Proceedings of the CONCUR 2001, 2001

2000
Automated compositional Markov chain generation for a plain-old telephone system.
Sci. Comput. Program., 2000

Compositional performance modelling with the TIPPtool.
Perform. Eval., 2000

A Markov Chain Model Checker.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

On the Use of Model Checking Techniques for Dependability Evaluation.
Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, 2000

Towards Model Checking Stochastic Process Algebra.
Proceedings of the Integrated Formal Methods, Second International Conference, 2000

On the Logical Characterisation of Performability Properties.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Process Algebra and Markov Chains.
Proceedings of the Lectures on Formal Methods and Performance Analysis, 2000

Model Checking Continuous-Time Markov Chains by Transient Analysis.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Interactive Markov chains = Interaktive Markovketten.
PhD thesis, 1999

On Generative Parallel Composition.
Electr. Notes Theor. Comput. Sci., 1999

Symbolic Minimisation of Stochastic Process Algebra Models.
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 1999

Approximate Symbolic Model Checking of Continuous-Time Markov Chains.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

TIPPtool: Compositional Specification and Analysis of Markovian Performance Models.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation.
Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

1998
Stochastic Process Algebras - Between LOTOS and Markov Chains.
Computer Networks, 1998

Exploiting Symmetries in Stochastic Process Algebras.
Proceedings of the 12<sup>th</sup> European Simulation Multiconference - Simulation, 1998

Compositional Performance Modelling with TIPPtool.
Proceedings of the Computer Performance Evaluation: Modelling Techniques and Tools, 1998

Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract).
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
Exploiting stochastic process algebra achievements for generalized stochastic Petri nets.
Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, 1997

Weak Bisimulation for Fully Probabilistic Processes.
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 1997

Weak Bisimulation for Fully Probabilistic Processes.
Proceedings of the Computer Aided Verification, 9th International Conference, 1997

1996
A Construction and Analysis Tool Based on the Stochastic Process Algebra TIPP.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

1995
Formal Characterisation of Immediate Actions in SPA with Nondeterministic Branching.
Comput. J., 1995

1994
Stochastic process algebras: integrating qualitative and quantitative modelling.
Proceedings of the Formal Description Techniques VII, 1994


  Loading...