Joost-Pieter Katoen
#82,892
Most Influential Person Now
Researcher
Joost-Pieter Katoen's AcademicInfluence.com Rankings
Joost-Pieter Katoencomputer-science Degrees
Computer Science
#3022
World Rank
#3169
Historical Rank
Software Engineering
#124
World Rank
#124
Historical Rank

Joost-Pieter Katoenmathematics Degrees
Mathematics
#5546
World Rank
#7797
Historical Rank
Measure Theory
#831
World Rank
#1098
Historical Rank

Download Badge
Computer Science Mathematics
Joost-Pieter Katoen's Degrees
- PhD Computer Science University of Twente
- Masters Mathematics University of Twente
Similar Degrees You Can Earn
Why Is Joost-Pieter Katoen Influential?
(Suggest an Edit or Addition)According to Wikipedia, Joost-Pieter Katoen is a Dutch theoretical computer scientist based in Germany. He is distinguished professor in Computer Science and head of the Software Modeling and Verification Group at RWTH Aachen University. Furthermore, he is part-time associated to the Formal Methods & Tools group at the University of Twente.
Joost-Pieter Katoen's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Principles of model checking (2008) (4925)
- Principles of Model Checking (Representation and Mind Series) (2008) (1132)
- Model-Checking Algorithms for Continuous-Time Markov Chains (2002) (797)
- The Ins and Outs of the Probabilistic Model Checker MRMC (2009) (367)
- A Storm is Coming: A Modern Probabilistic Model Checker (2017) (362)
- Model-Based Testing of Reactive Systems, Advanced Lectures [The volume is the outcome of a research seminar that was held in Schloss Dagstuhl in January 2004] (2005) (359)
- A probabilistic extension of UML statecharts: Specification and Verification. (2002) (290)
- Approximate Symbolic Model Checking of Continuous-Time Markov Chains (1999) (289)
- A Markov reward model checker (2005) (282)
- Process algebra for performance evaluation (2002) (265)
- Safety, Dependability and Performance Analysis of Extended AADL Models (2011) (220)
- Model Checking Continuous-Time Markov Chains by Transient Analysis (2000) (196)
- Approximate Model Checking of Stochastic Hybrid Systems (2010) (180)
- Comparative branching-time semantics for Markov chains (2005) (176)
- MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems (2006) (162)
- The Bounded Retransmission Protocol Must Be on Time! (1997) (156)
- Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science) (2005) (145)
- Model-Based Testing of Reactive Systems, Advanced Lectures (2005) (143)
- Discrete-Time Rewards Model-Checked (2003) (142)
- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes (2005) (135)
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking (2007) (134)
- On the Logical Characterisation of Performability Properties (2000) (128)
- Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (2009) (126)
- Counterexample Generation in Probabilistic Model Checking (2009) (126)
- Counterexamples in Probabilistic Model Checking (2007) (124)
- Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (2016) (123)
- A compositional modelling and analysis framework for stochastic hybrid systems (2013) (122)
- A Markov Chain Model Checker (2000) (118)
- The Probabilistic Model Checking Landscape* (2016) (117)
- PROPhESY: A PRObabilistic ParamEter SYnthesis Tool (2015) (115)
- Concepts, Algorithms, and Tools for Model Checking (1999) (109)
- Three-Valued Abstraction for Continuous-Time Markov Chains (2007) (108)
- On the use of model checking techniques for dependability evaluation (2000) (107)
- The COMPASS Approach: Correctness, Modelling and Performability of Aerospace Systems (2009) (105)
- A tool for model-checking Markov chains (2003) (101)
- Quantitative and Qualitative Extensions of Event Structures (1996) (101)
- libalf: The Automata Learning Framework (2010) (98)
- Automated compositional Markov chain generation for a plain-old telephone system (2000) (98)
- Model checking performability properties (2002) (97)
- Performance evaluation and model checking join forces (2010) (95)
- Safety-Constrained Reinforcement Learning for MDPs (2015) (92)
- Validation of Stochastic Systems (2004) (90)
- Faster and Symbolic CTMC Model Checking (2001) (89)
- Lectures on Formal Methods and PerformanceAnalysis (2001) (88)
- Reasoning about Recursive Probabilistic Programs* (2016) (83)
- On a Temporal Logic for Object-Based Systems (2000) (82)
- Abstract Probabilistic Automata (2011) (82)
- Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods (2010) (81)
- Beyond Memoryless Distributions: Model Checking Semi-Markov Chains (2001) (80)
- An algebraic approach to the specification of stochastic systems (1998) (78)
- Formal correctness, safety, dependability, and performance analysis of a satellite (2012) (78)
- A theory of stochastic systems part I: Stochastic automata (2005) (78)
- Fast Dynamic Fault Tree Analysis by Model Checking Techniques (2018) (77)
- Parameter Synthesis for Markov Models: Faster Than Ever (2016) (75)
- Approximate Parameter Synthesis for Probabilistic Time-Bounded Reachability (2008) (71)
- On Generative Parallel Composition (1998) (71)
- A Stochastic Causality-Based Process Algebra (1995) (70)
- How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison (2007) (70)
- A Semantics for Every GSPN (2013) (70)
- A new proof rule for almost-sure termination (2017) (68)
- Model checking mobile stochastic logic (2007) (67)
- Operational versus weakest pre-expectation semantics for the probabilistic guarded command language (2014) (66)
- MoDeST - A Modelling and Description Language for Stochastic Timed Systems (2001) (63)
- The How and Why of Interactive Markov Chains (2009) (62)
- Accelerating Parametric Probabilistic Verification (2013) (61)
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes (2009) (61)
- Three-valued abstraction for probabilistic systems (2012) (60)
- Quantitative Timed Analysis of Interactive Markov Chains (2012) (60)
- Towards Model Checking Stochastic Process Algebra (2000) (60)
- The probabilistic model checker Storm (2020) (59)
- Conditioning in Probabilistic Programming (2015) (58)
- Model-checking large structured Markov chains (2003) (58)
- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning (2007) (58)
- A Parallel program for the recognition of P-Invariant segments (1992) (57)
- Pomsets for message sequence charts (1998) (57)
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes (2007) (56)
- Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems (2013) (56)
- On the Hardness of Almost-Sure Termination (2015) (56)
- Compositional Abstraction for Stochastic Systems (2009) (55)
- Spacecraft early design validation using formal methods (2014) (54)
- A Greedy Approach for the Efficient Repair of Stochastic Models (2015) (50)
- Efficient Modelling and Generation of Markov Automata (2012) (50)
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (2018) (49)
- Modelling, Reduction and Analysis of Markov Automata (2013) (49)
- Finite-State Controllers of POMDPs using Parameter Synthesis (2017) (49)
- Lectures on Formal Methods and Performance Analysis, First EEF/Euro Summer School on Trends in Computer Science, Berg en Dal, The Netherlands, July 3-7, 2000, Revised Lectures (2002) (48)
- Minimal Critical Subsystems for Discrete-Time Markov Models (2012) (47)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (2014) (46)
- Discrete-time rewards model-checked (to appear) (2003) (46)
- Formal Methods for Real-Time and Probabilistic Systems (1999) (45)
- Model checking Markov reward models with impulse rewards (2005) (45)
- Design and analysis of dynamic leader election protocols in broadcast networks (1993) (44)
- Automated Performance and Dependability Evaluation Using Model Checking (2002) (44)
- A theory of Stochastic systems. Part II: Process algebra (2005) (44)
- Efficient CTMC Model Checking of Linear Real-Time Objectives (2011) (43)
- A Local Greibach Normal Form for Hyperedge Replacement Grammars (2011) (42)
- A Probabilistic Extension of UML Statecharts (2002) (42)
- Maximizing system lifetime by battery scheduling (2009) (41)
- Modeling Systems by Probabilistic Process Algebra: an Event Structures Approach (1993) (40)
- Metric Semantics for True Concurrent Real Time (1998) (40)
- Quantitative automata model checking of autonomous stochastic hybrid systems (2011) (40)
- DTMC Model Checking by SCC Reduction (2010) (40)
- Automatic Verification of a Lip-Synchronisation Protocol Using Uppaal (1998) (39)
- Computing Optimal Schedules of Battery Usage in Embedded Systems (2010) (38)
- Quantitative separation logic: a logic for reasoning about probabilistic pointer programs (2018) (37)
- On Specifying Real-Time Systems in a Causality-Based Setting (1996) (37)
- Uncovering Dynamic Fault Trees (2016) (37)
- General Distributions in Process Algebra (2002) (37)
- Hierarchical Counterexamples for Discrete-Time Markov Chains (2011) (36)
- High-Level Counterexamples for Probabilistic Automata (2013) (36)
- Analysis of Timed and Long-Run Objectives for Markov Automata (2014) (36)
- Sound Value Iteration (2018) (36)
- A QoS-Oriented Extension of UML Statecharts (2003) (35)
- Synthesis in pMDPs: A Tale of 1001 Parameters (2018) (35)
- The Modest Modeling Tool and Its Implementation (2003) (35)
- Synthesis and Verification of Self-aware Computing Systems (2017) (35)
- Robust PCTL model checking (2012) (35)
- Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability (2005) (34)
- Probably on Time and within BudgetOn Reachability in Priced Probabilistic Timed Automata (2006) (34)
- A Model Checker for AADL (2010) (34)
- Validation of Stochastic Systems: A Guide to Current Research (Lecture Notes in Computer Science) (2004) (34)
- Safety Analysis for Vehicle Guidance Systems with Dynamic Fault Trees (2019) (33)
- Abstraction for Stochastic Systems by Erlang's Method of Stages (2008) (33)
- A Design Model for Open Distributed Processing Systems (1995) (33)
- The COMICS Tool - Computing Minimal Counterexamples for DTMCs (2012) (33)
- Model-Checking Algorithms for (2003) (33)
- On the hardness of analyzing probabilistic programs (2018) (32)
- Causal Ambiguity and Partial Orders in Event Structures (1997) (32)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (2017) (32)
- Code generation based on formal BURS theory and heuristic search (1997) (32)
- A Stochastic Automata Model and its Algebraic Approach (1997) (31)
- Automatic Veri cation of a Lip Synchronisation Algorithm using Uppaal (1998) (31)
- Parameter Synthesis for Markov Models (2019) (30)
- Codesign of dependable systems: A component-based modeling language (2009) (29)
- Formal Verification and Validation of AADL Models (2010) (29)
- Who is Pointing When to Whom? (2004) (29)
- Performability assessment by model checking of Markov reward models (2010) (29)
- Quantitative model-checking of controlled discrete-time Markov processes (2014) (29)
- Simulation for Continuous-Time Markov Chains (2002) (28)
- MoDeST: A compositional modeling formalism for real-time and stochastic systems (2004) (28)
- Fast Debugging of PRISM Models (2014) (28)
- Minimal counterexamples for linear-time probabilistic verification (2014) (27)
- Regular Expressions for PCTL Counterexamples (2008) (26)
- Learning Communicating Automata from MSCs (2010) (26)
- Prinsys - On a Quest for Probabilistic Loop Invariants (2013) (26)
- Model Checking Birth and Death (2002) (26)
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains (2008) (25)
- SMT-Based Bisimulation Minimisation of Markov Models (2013) (25)
- Model checking meets performance evaluation (2005) (24)
- Modelling and Verifying a Bounded Retransmission Protocol (1996) (24)
- The Surprising Robustness of (Closed) Timed Automata against Clock-Drift (2008) (24)
- New Results on Abstract Probabilistic Automata (2011) (24)
- Model checking for performability (2013) (23)
- On the Complexity of Reachability in Parametric Markov Decision Processes (2019) (23)
- Specification and analysis of soft real-time systems: quantity and quality (1999) (23)
- GSPNs Revisited: Simple Semantics and New Analysis Algorithms (2012) (23)
- How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times (2018) (23)
- Verifying Concurrent List-Manipulating Programs by LTL Model Checking (2007) (23)
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (2016) (23)
- Understanding Probabilistic Programs (2015) (23)
- Simulation-Based CTMC Model Checking: An Empirical Evaluation (2009) (22)
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking (2007) (22)
- Weighted Lumpability on Markov Chains (2011) (22)
- Model checking dependability attributes of wireless group communication (2004) (21)
- Multi-cost Bounded Reachability in MDP (2018) (21)
- Aiming low is harder: induction for lower bounds in probabilistic program verification (2019) (21)
- Partial Order Models for Quantitative Extensions of LOTOS (1998) (21)
- General Purpose Discrete Event Simulation using (1998) (21)
- GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components (2014) (21)
- Smart railroad maintenance engineering with stochastic model checking (2014) (21)
- Model checking of Scenario-Aware Dataflow with CADP (2012) (20)
- Probabilistic weak simulation is decidable in polynomial time (2004) (20)
- Towards Model Checking OCL (2000) (20)
- Stochastic Simulation of Event Structures (1996) (20)
- A linear process-algebraic format with data for probabilistic automata (2012) (20)
- Are you still there? - A lightweight algorithm to monitor node presence in self-configuring networks (2005) (20)
- A weakest pre-expectation semantics for mixed-sign expectations (2017) (19)
- Shepherding Hordes of Markov Chains (2019) (19)
- ETMCC: model checking performability properties of Markov chains (2003) (19)
- Markov automata with multiple objectives (2017) (19)
- Symbolic counterexample generation for large discrete-time Markov chains (2014) (19)
- Motion planning under partial observability using game-based abstraction (2017) (19)
- Bottom-Up Tree Acceptors (1989) (19)
- Towards a Logic for Performance and Mobility (2006) (19)
- Bounded Model Checking for Probabilistic Programs (2016) (18)
- Time-Abstracting Bisimulation for Probabilistic Timed Automata (2008) (17)
- On integrating the MOBIUS and MODEST modeling tools (2003) (17)
- Who is Pointing When to Whom? On the Automated Verification of Linked List Structures (2004) (17)
- A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions (1996) (17)
- Simple Strategies in Multi-Objective MDPs (2019) (17)
- Advancing Dynamic Fault Tree Analysis - Get Succinct State Spaces Fast and Synthesise Failure Rates (2016) (17)
- A UMTS network architecture (1994) (16)
- Counterexample-Driven Synthesis for Probabilistic Program Sketches (2019) (16)
- Performance analysis and true concurrency semantics (1994) (16)
- Model-Based Safety Analysis for Vehicle Guidance Systems (2017) (16)
- Comparative Branching-Time Semantics (2003) (15)
- Performance Analysis of Computing Servers using Stochastic Petri Nets and Markov Automata (2013) (15)
- Safety and Liveness in Concurrent Pointer Programs (2005) (15)
- Labelled Transition Systems (2004) (15)
- Parametric LTL on Markov Chains (2014) (15)
- Compositional Abstraction Techniques for Probabilistic Automata (2012) (15)
- Reachability in continuous-time Markov reward decision processes (2008) (15)
- Finite-state Controllers of POMDPs via Parameter Synthesis* (2019) (15)
- Fault trees on a diet: automated reduction by graph rewriting (2015) (14)
- YMCA: - Why Markov Chain Algebra? - (2006) (14)
- Model-Checking Assisted Protocol Design for Ultra-reliable Low-Latency Wireless Networks (2016) (14)
- Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains (2001) (14)
- One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs (2018) (14)
- The 10, 000 Facets of MDP Model Checking (2019) (14)
- System-Software Co-Engineering: Dependability and Safety Perspective (2011) (13)
- Model-Based Codesign of Critical Embedded Systems (2009) (13)
- A Linear Process-Algebraic Format for Probabilistic Systems with Data (2010) (13)
- Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains (2008) (13)
- Model Checking of Open Interval Markov Chains (2015) (13)
- Zero-reachability in probabilistic multi-counter automata (2014) (13)
- LTL Model Checking of Time-Inhomogeneous Markov Chains (2009) (13)
- Exponentially timed SADF: Compositional semantics, reductions, and analysis (2014) (13)
- An Algebraic Approach to the Speciication of Stochastic Systems (extended Abstract) (1998) (13)
- Automated Termination Analysis of Polynomial Probabilistic Programs (2020) (12)
- On the Satisfiability of Some Simple Probabilistic Logics (2016) (12)
- Verifying Auto-generated C Code from Simulink - An Experience Report in the Automotive Domain (2018) (12)
- A Compositional Approach to Generalised semi-Markov Processes (1998) (12)
- Computing Maximum Reachability Probabilities in Markovian Timed Automata (2010) (12)
- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning (2008) (12)
- Verification and performance evaluation of aadl models (2009) (12)
- Model Checking Meets Probability: A Gentle Introduction (2013) (11)
- Time-Bounded Reachability in Tree-Structured QBDs by Abstraction (2009) (11)
- Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms (2017) (11)
- Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning (2021) (11)
- Symbolic Counterexample Generation for Discrete-Time Markov Chains (2012) (11)
- Verification of indefinite-horizon POMDPs (2020) (11)
- Motor: The MoDeST Tool Environment (2007) (11)
- A true concurrency semantics for ET-LOTOS (1998) (11)
- Scenario-Based Verification of Uncertain MDPs (2019) (11)
- Perspectives in Probabilistic Verification (2008) (11)
- Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems (2013) (11)
- Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language (2012) (10)
- Layered reasoning for randomized distributed algorithms (2012) (10)
- Observing Continuous-Time MDPs by 1-Clock Timed Automata (2011) (10)
- Latticed k-Induction with an Application to Probabilistic Programs (2021) (10)
- Code Generation = A* + BURS (1996) (10)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (2015) (10)
- Are Parametric Markov Chains Monotonic? (2019) (10)
- Probably safe or live (2014) (10)
- Verifying pointer programs using graph grammars (2015) (10)
- Tools and Algorithms for the Construction and Analysis of Systems (2002) (10)
- Analyzing Energy Consumption in a Gossiping MAC Protocol (2010) (10)
- Parameter-Independent Strategies for pMDPs via POMDPs (2018) (10)
- Boosting Fault Tree Analysis by Formal Methods (2017) (9)
- Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems (2015) (9)
- First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders (2001) (9)
- Compass 3.0 (2019) (9)
- Reachability probabilities in Markovian Timed Automata (2011) (9)
- Inductive Synthesis for Probabilistic Programs Reaches New Horizons (2021) (9)
- Automatic Verification of a Lip-Synchronisation Algorithm Using UPPAAL - Extended Version (1998) (9)
- Causal Behaviours and Nets (1995) (9)
- Formal Methods for Aerospace Systems (2017) (9)
- Stochastic model checking (2006) (9)
- Fault trees on a diet: automated reduction by graph rewriting (2017) (9)
- Algebraic specification of dynamic leader election protocols in broadcast networks (1995) (8)
- A Statistical Approach for Timed Reachability in AADL Models (2015) (8)
- SMA - The Smyle Modeling Approach (2008) (8)
- Leader Election in Anonymous Radio Networks: Model Checking Energy Consumption (2010) (8)
- Multi-cost Bounded Tradeoff Analysis in MDP (2020) (8)
- Generative Datalog with Continuous Distributions (2020) (8)
- A pre-expectation calculus for probabilistic sensitivity (2020) (8)
- Model Checking for Safe Navigation Among Humans (2018) (8)
- The Partially Observable Games We Play for Cyber Deception (2018) (8)
- Embedded Software Analysis with MOTOR (2004) (8)
- Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification (2019) (8)
- Stochastic Games with Lexicographic Reachability-Safety Objectives (2020) (7)
- Analysing and Improving Energy Efficiency of Distributed Slotted Aloha (2011) (7)
- Scenario-based verification of uncertain parametric MDPs (2021) (7)
- Convex Optimization for Parameter Synthesis in MDPs (2021) (7)
- Model-based energy optimization of automotive control systems (2013) (7)
- A DFT Modeling Approach for Infrastructure Reliability Analysis of Railway Station Areas (2019) (7)
- Who is pointing When to Whom: On Model-Checking Pointer Structures (2003) (7)
- Comparative Branching-Time Semantics for Markov Chains (Extended Abstract) (2003) (7)
- Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions (2020) (7)
- How to model and analyze gossiping protocols? (2008) (7)
- PrIC3: Property Directed Reachability for MDPs (2020) (7)
- Pomsets for MSC (1998) (7)
- Bisimulation and Simulation Relations for Markov Chains (2006) (7)
- Advancing Dynamic Fault Tree Analysis (2016) (7)
- The Probabilistic Model Checker Storm (Extended Abstract) (2016) (7)
- Model Checking pathCSL (2003) (7)
- Implementing a Model Checker for Performability Behaviour (2001) (6)
- Counterexamples for Expected Rewards (2015) (6)
- Inferring Covariances for Probabilistic Programs (2016) (6)
- Functional integration of UMTS and B-ISDN (1995) (6)
- Minimal Critical Subsystems as Counterexamples for omega-Regular DTMC Properties (2012) (6)
- Minimal Counterexamples for Refuting ω-Regular Properties of Markov Decision Processes – Extended Version – (2012) (6)
- Symmetry reduction for stochastic hybrid systems (2008) (6)
- Modeling and Verifying a Bounded Retransmission (1996) (6)
- Interpretation-Based Violation Witness Validation for C: NITWIT (2020) (6)
- Improving Generalization in Software IC3 (2018) (6)
- Model Checking CSRL-Specified Performability Properties (2001) (6)
- Quantitative Evaluation in Embedded System Design: Trends in Modeling and Analysis Techniques (2008) (6)
- Probabilistic Model Checking for Uncertain Scenario-Aware Data Flow (2016) (6)
- Efficient Modelling and Generation of Markov Automata (extended version) (2012) (6)
- A Stochastic Causality-Based Process (1995) (5)
- Model checking for dynamic allocation and deallocation (2001) (5)
- Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation (2017) (5)
- Modelling and statistical model checking of a microgrid (2015) (5)
- Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming (2021) (5)
- A Semi-Markov Model of a Home Network Access Protocol (1993) (5)
- Modelling, Reduction and Analysis of Markov Automata (extended version) (2013) (5)
- Finding Provably Optimal Markov Chains (2021) (5)
- A two-step scheme for approximate model checking of stochastic hybrid systems ⋆ (2011) (5)
- Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems (2019) (5)
- Proving Linearizability via Branching Bisimulation (2016) (5)
- Foundations for Entailment Checking in Quantitative Separation Logic (extended version) (2022) (5)
- Bayesian Inference by Symbolic Model Checking (2020) (5)
- Quantitative Separation Logic (2018) (5)
- Layered Reduction for Abstract Probabilistic Automata (2014) (5)
- Local Reasoning about Parameterized Reconfigurable Distributed Systems (2021) (4)
- Performance Evaluation of Concurrent Data Structures (2016) (4)
- Part I. Testing of Finite State Machines (2004) (4)
- The COMICS Tool - Computing Minimal Counterexamples for Discrete-time Markov Chains (2012) (4)
- Model Checking: One Can Do Much More Than You Think! (2011) (4)
- Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations (2018) (4)
- Layered Reduction for Modal Specification Theories (2013) (4)
- PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs (2021) (4)
- The complexity of reachability in parametric Markov decision processes (2021) (4)
- CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings (2011) (4)
- Kantorovich Continuity of Probabilistic Programs (2019) (3)
- Rule-Based Conditioning of Probabilistic Data (2018) (3)
- Relatively Complete Verification of Probabilistic Programs (2020) (3)
- Tight Game Abstractions of Probabilistic Automata (2014) (3)
- Gradient-Descent for Randomized Controllers under Partial Observability (2021) (3)
- Weakest Preexpectation Semantics for Bayesian Inference (2020) (3)
- Model Checking Markov Chains Using Krylov Subspace Methods: An Experience Report (2010) (3)
- Advances in Probabilistic Model Checking (2010) (3)
- Multiple Analyses, Requirements Once: simplifying testing & verification in automotive model-based development (2019) (3)
- Counterexample-guided inductive synthesis for probabilistic systems (2021) (3)
- Parameter Synthesis for Probabilistic Systems (2016) (3)
- Monitoring CTMCs by Multi-clock Timed Automata (2018) (3)
- Parameter Synthesis in Markov Models: A Gentle Survey (2022) (3)
- Probabilistic Model Checking for Complex Cognitive Tasks - A case study in human-robot interaction (2016) (3)
- Reference Configurations for Umts (1995) (3)
- motor: The modestTool Environment (2007) (3)
- Under-Approximating Expected Total Rewards in POMDPs (2022) (3)
- Weighted programming: a programming paradigm for specifying mathematical models (2022) (3)
- Recognizing k-Rotated Segments (1993) (3)
- A Compositional Semantics for Repairable BDMPs (2020) (3)
- Fine-Tuning the Odds in Bayesian Networks (2021) (3)
- Model Repair Revamped - - On the Automated Synthesis of Markov Chains - (2019) (3)
- Benchmarking Software Model Checkers on Automotive Code (2020) (3)
- Probabilistic Verification for Cognitive Models (2016) (3)
- Generating Functions for Probabilistic Programs (2020) (3)
- Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions (2022) (3)
- Model he king ontinuous-time Markov hainsby transient (2006) (3)
- Abstraction of Probabilistic Systems (2007) (3)
- Probabilistic Programming: A True Verification Challenge (2015) (3)
- Performance and verification (2005) (2)
- Using UPPAAL for the Speci cation and Veri cation of a Lip-Sync Protocol (1998) (2)
- An industrial-strength formal method -- A Modest survey (2004) (2)
- High-level Counterexamples for Probabilistic Automata – Extended Version ? – (2013) (2)
- B-ISDN to the Cell Site Switch versus B-ISDN the Mobile Terminal (1996) (2)
- Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs (2018) (2)
- Model Checking Temporal Properties of Recursive Probabilistic Programs (2021) (2)
- Weakest Preexpectation Semantics for Bayesian Inference - Conditioning, Continuous Distributions and Divergence (2019) (2)
- DFT modeling approach for operational risk assessment of railway infrastructure (2022) (2)
- Synergizing Reliability Modeling Languages: BDMPs without Repairs and DFTs (2019) (2)
- Systolic Arrays for the Recognition of Permutation-Invariant Segments (1996) (2)
- The Probabilistic Termination Tool Amber (2021) (2)
- Correct-by-construction policies for POMDPs (2019) (2)
- Tweaking the Odds in Probabilistic Timed Automata (2021) (2)
- Scalable Reliability Analysis by Lazy Verification (2021) (2)
- Formal Verification of Rewriting Rules for Dynamic Fault Trees (2019) (2)
- Recognizing Perfect-shuues (1989) (2)
- Quantitative Modelling and Analysis (2012) (1)
- Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181) (2015) (1)
- Pattern-matching algorithms based on term rewrite systems (2000) (1)
- Probabilistic Model Checking of AODV (2020) (1)
- Model Checking the Multi-Formalism Language FIGARO (2021) (1)
- A design model for open distributed systems (1994) (1)
- Machine Learning and Model Checking Join Forces (Dagstuhl Seminar 18121) (2018) (1)
- Strategy Synthesis in POMDPs via Game-Based Abstractions (2017) (1)
- Multi-terminal decision diagrams: a data structure for numerical integration (1999) (1)
- Towards Trustworthy Aerospace Systems: An Experience Report (2011) (1)
- UMTS Functional Model (1993) (1)
- Modal Stochastic Games - Abstraction-Refinement of Probabilistic Automata (2017) (1)
- Proceedings of the First International Conference on the Quantitative Evaluation of Systems (QEST) (2004) (1)
- Preliminary Version Towards a Logic for Performance and Mobility (1)
- Correct and efficient accelerator programming (2013) (1)
- Modelling stochastic timed systems (2001) (1)
- Compositional Analysis Using Component-Oriented Interpolation (2014) (1)
- Guest Editors' Introduction to the Special Section on the First International Conference on the Quantitative Evaluation of SysTems (QEST) (2006) (1)
- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration (2023) (1)
- Concurrency Meets Probability: Theory and Practice - (Abstract) (2013) (1)
- Expected Runtime Analysis by Program Verification (2020) (1)
- Guest editors' introduction: Model checking in a nutshell (2002) (1)
- Various Ways to Quantify BDMPs (2020) (1)
- Performance analysis and true concurrency semantics (extended abstract) (1994) (1)
- An efficient algorithm tocompute the minimal and maximal probabilities for timed reachability incontinuous-time Markov decision processes (2003) (1)
- Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard (2014) (1)
- Performance Analysis of Computing Servers - A Case Study Exploiting a New GSPN Semantics (2014) (1)
- Part II. Testing of Labeled Transition Systems (2004) (1)
- Generative Datalog with Continuous Distributions (2022) (1)
- Probabilistic Data with Continuous Distributions (2021) (1)
- Explaining Boolean-Logic Driven Markov Processes using GSPNs (2020) (1)
- Simple Strategies in Multi-Objective MDPs (Technical Report) (2019) (1)
- Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142) (2013) (1)
- A model checker for performance and dependability properties (2001) (1)
- The Probabilistic Model Checker Storm: Evaluation Results and Replication Package (2020) (1)
- Synthesizing optimal bias in randomized self-stabilization (2021) (1)
- Quantitative Verification in Practice (2010) (1)
- The Bounded Retransmission Protocol Must Beon Time! Full Version (1997) (1)
- Branching Bisimulation and Concurrent Object Verification (2018) (1)
- Verification and Performance Evaluation of AADL Models (Tool Demonstration) (2009) (1)
- Inferring Heap Abstraction Grammars (2012) (1)
- Formal validation methods in model-based spacecraft systems engineering (2018) (1)
- Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants (2022) (1)
- General Purpose Discrete Event Simulation (1998) (1)
- On Generative Parallel Composition 1 (1999) (1)
- Dynamic fault tree analysis using binary decision diagrams (2020) (1)
- Reasoning about distributed reconfigurable systems (2022) (1)
- Regular Expressions for PCTL Counterexamples Berteun Damman (2007) (1)
- Part III. Model-Based Test Case Generation (2004) (1)
- Learning probabilistic automata with SMT solving (2021) (0)
- Part V. Standardized Test Notation and Execution Architecture (2004) (0)
- Model-Based Testing of Reactive Systems, Advanced Lectures : outcome of a research seminar (2005) (0)
- S E ] 2 0 O ct 2 01 5 Safety-Constrained Reinforcement Learning for MDPs ⋆ (2018) (0)
- Stochastic games with lexicographic objectives (2023) (0)
- 07101 Abstracts Collection -- Quantitative Aspects of Embedded Systems (2007) (0)
- A Paral L El Program for the Recogni Ti on of P-invariant Segments (1991) (0)
- B-isdn to the Cell Site Switch versus B-isdn to the Mobile Terminal 1 (0)
- The systematic development of a pattern-matching algorithm using term rewrite systems (1997) (0)
- MODEL CHECKING FOR DYNAMIC ALLOCATION AND DEALLOCATION Extended Abstract (2002) (0)
- Formal Methods and Tools: Fundamental Research Issues (2000) (0)
- Model Checking Gigantic Markov Models (2014) (0)
- Specification and Verification of a Dynamic Leader Election Protocol in a Broadcast Network (1993) (0)
- POMDP Controllers with Optimal Budget (2022) (0)
- On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata (2023) (0)
- Reasoning about Reconfigurations of Distributed Systems (2021) (0)
- Comparative Branching-Time Semantics for Markov Chains 3 and Continuous Stochastic (0)
- Viewpoints on "Logic activities in Europe", twenty years later (2016) (0)
- 12 An Algebraic Approach to the Specification of Stochastic Systems ( Extended Abstract ) (2013) (0)
- {SMA}–-The {S}myle Modeling Approach (2008) (0)
- motor :T hemodest Tool Environment (2007) (0)
- Report on 1st AMAST international workshop on real-time systems (1994) (0)
- Synergising Reliability Modelling Languages: BDMPs and Repairable DFTs (2021) (0)
- Formal Aspects of Computing Layered reasoning for randomized distributed algorithms (0)
- A compositional modelling and analysis framework for stochastic hybrid systems (2012) (0)
- Proceedings of the First Int. Conf. on the Quantitative Evaluation of Systems (QEST) (2004) (0)
- Dagstuhl Seminar 13142 on Correct and Efficient Accelerator Programming (2013) (0)
- Guest editors’ introduction: Advancements and extensions of verification techniques (2004) (0)
- Concurrency, Interaction, Abstraction and Randomness (extended abstract): Invited Presentation at the Third Interaction and Concurrency Experience: Guaranteed Interaction (2010) (0)
- Probabilistic Verification with MRMC 2 . 1 . Models and Logics (2019) (0)
- Foundations of Multi-Core Memory Models Introductory Meeting to this Seminar (2012) (0)
- P L ] 1 A pr 2 01 5 Conditioning in Probabilistic Programming (2015) (0)
- Modeling, Verification and Control of Complex Systems: from Foundations to Power Network Applications Report D1.1 Report on Modeling Framework, Model Composition, and Bisimulation Notions Project Title: Modeling, Verification and Control of Complex Systems: from Foundations to Power Network Applicat (0)
- Towards Concurrent Quantitative Separation Logic (2022) (0)
- A Stochastic Automata Model and its Algebraic (1995) (0)
- Tweaking The Odds: Parameter Synthesis in Markov Models (Abstract) (2017) (0)
- Lower Bounds for Possibly Divergent Probabilistic Programs (2023) (0)
- Validation for C: NITWIT (2020) (0)
- Quantitative Aspects of Embedded Systems, 04.03. - 09.03.2007 (2007) (0)
- 2 The definition of BOTL (0)
- Inductive Synthesis of Finite-State Controllers for POMDPs (2022) (0)
- Layered reasoning for randomized distributed algorithms (2012) (0)
- MoDeST Modelling of Hard an Softly Timed Systems (2006) (0)
- ModelEd, TestEd, TrustEd (2017) (0)
- Counterexample Generation in (2009) (0)
- 124 15181 – Challenges and Trends in Probabilistic Programming and (2015) (0)
- Performance analysis := (process algebra + model checking) x Markov chains (2001) (0)
- Tele-informatics Open Systems Performance Analysis and True Concurrency Semantics Performance Anal Ysi S and True Concurrency Semanti Cs (1994) (0)
- Prinsys – a Software Tool for the Synthesis of Probabilistic Invariants ⋆ (2012) (0)
- Formal Methods and Tools: Tool Development (2000) (0)
- Out of Control: Reducing Probabilistic Models by Control-State Elimination (2020) (0)
- Weighted Programming (2022) (0)
- Semidefinite programming approximations for stable sets, colouring, and cuts in graphs (2009) (0)
- Proposal for a new Modelling Concept: the Functional Architecture (1993) (0)
- Rule-based Conditioning of Probabilistic Data Integration and NLP Results (2018) (0)
- On the hardness of analyzing probabilistic programs (2018) (0)
- Dependable Software Engineering. Theories, Tools, and Applications: 5th International Symposium, SETTA 2019, Shanghai, China, November 27–29, 2019, Proceedings (2019) (0)
- BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees (2022) (0)
- Part VI. Beyond Testing (2004) (0)
- QEST 2004: First International Conference on the Quantitative Evaluation of Systems : Proceedings (2004) (0)
- Subjects T1: Testing of Finite State Machines (5 Chapters) T2: Preorder-based Testing of Labeled Transition Systems (5 Chap- Ters) (0)
- Mapping of some mobility procedures on UMTS reference configurations (1994) (0)
- A Stochastic Logic for Mobility and Global Computing (2009) (0)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (2015) (0)
- Stochastic process algebras: linking process descriptions with performance (2000) (0)
- 07101 Executive Summary -- Quantitative Aspects of Embedded Systems (2007) (0)
- Abstraktions-basierte Verifikation von POMDPs im Motion-Planning-Kontext (2018) (0)
- A Compositional Semantics of Boolean-Logic Driven Markov Processes (2023) (0)
- Hooggespannen verwachtingen model checking (2001) (0)
- 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (2019) (0)
- M ar 2 01 6 Reasoning about Recursive Probabilistic Programs ∗ (2021) (0)
- Evolution Strategies Towards UMTS (1993) (0)
- Part IV. Tools and Case Studies (2004) (0)
- Probabilistic specifications with data types (2009) (0)
- A Calculus for Amortized Expected Runtimes (2022) (0)
- Correct and Efficient Accelerator Programming 1 Executive Summary (2015) (0)
- QUPES - verifying QUantitative Properties of Embedded Software (2005) (0)
- Multi-objective Optimization of Long-run Average and Total Rewards (2020) (0)
- Implementation of a Predicate-Guided Termination Analysis for Pointer Programs (2020) (0)
- Smyle — Synthesis of Design Models from Scenarios by Learning (2007) (0)
- Comparison of Different Approaches to Automated Verification of Pointer Programs (2015) (0)
- B-ISDN to the Cell Switch versus B-ISDN to the Mobile Terminal (1996) (0)
- Synthesis and verification of self-aware systems (2016) (0)
- Abstraction-based Model Checking of POMDPs in Motion Planning ∗ (2017) (0)
- C PROPhESY : A PRObabilistic ParamEter SYnthesis Tool ? (2016) (0)
- Real-Time and Probabilistic Systems - Foreword (2002) (0)
- P-Automata for Markov Decision Processes (2015) (0)
- S E ] 1 7 D ec 2 01 3 Accelerating Parametric Probabilistic Verification ⋆ (2013) (0)
- Causal Behavi Ours and Nets (1995) (0)
- Approximate Model Checking of Stochastic Hybrid Systemsg (2010) (0)
- Automatic Veri cation of a Lip SynchronisationAlgorithm Using UPPAAL-Extended Version-H (1998) (0)
- On The Semantic Intricacies of Conditioning (2015) (0)
- L O ] 1 9 Ju l 2 01 9 Are Parametric Markov Chains Monotonic ? (0)
- Configurable Benchmarks for C Model Checkers (2022) (0)
- Analysis and scheduler synthesis of time-bounded reachability in continuous-time Markov decision processes (2009) (0)
- IC3 software model checking (2019) (0)
- Proposal for a UMTS Functional Architecture (1993) (0)
- Confluence Reduction for Markov Automata 1 (2015) (0)
- Constraint-oriented specification of performance aspects (2006) (0)
- On the Hardness of PCTL Satisfiability (2015) (0)
- Modelling and Analysis of Fire Sprinklers by Verifying Dynamic Fault Trees (2021) (0)
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (2016) (0)
- Proceedings of the 22nd international conference on Concurrency theory (2011) (0)
- L O ] 1 3 A pr 2 01 8 Sound Value Iteration ⋆ (0)
- Part VII. Appendices (2004) (0)
- Automatic Verification of a Lip Synchronisation Algorithm Using UPPAAL 2 The Lip Synchronisation Problem 2 (1998) (0)
- Quantitative Aspects of Embedded Systems Dagstuhl Seminar (2007) (0)
- H?2 "mhh2ibm Q7 I?2 1h*a Title: Efficient Modelling, Generation and Analysis of Markov Automata (0)
- Thread-Modular Analysis of Heap-Manipulating Programs (2015) (0)
- Synthesizing optimal bias in randomized self-stabilization (2021) (0)
- Probabilistic Programs - A Natural Model for Approximate Computations (2015) (0)
- Guest editors’ introduction: quantitative analysis of real-time embedded systems (2006) (0)
- Formal Methods and Tools: Applications (2000) (0)
- Exact Probabilistic Inference Using Generating Functions (2023) (0)
- Multi-station bus system with means for accessing and updating relevant information in general, and in particular a station address and station for use in such a system (1992) (0)
- Model Repair Revamped: On the Automated Synthesis of Markov Chains (2021) (0)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (2022) (0)
- HIGH-LEVEL COUNTEREXAMPLES (2015) (0)
- SMT-Based Bisimulation and Verification of Markov Models (2015) (0)
- Modelling and statistical model checking of a microgrid (2014) (0)
This paper list is powered by the following services:
Other Resources About Joost-Pieter Katoen
What Schools Are Affiliated With Joost-Pieter Katoen?
Joost-Pieter Katoen is affiliated with the following schools: