default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoost-Pieter Katoen
Person information
- affiliation: RWTH Aachen University, Germany
- affiliation: University of Twente, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2008
[b1]Christel Baier, Joost-Pieter Katoen:
Principles of model checking. MIT Press 2008, ISBN 978-0-262-02649-9, pp. I-XVII, 1-975
Journal Articles
- 2024
- [j104]Sebastian Junges, Erika Ábrahám, Christian Hensel, Nils Jansen
, Joost-Pieter Katoen, Tim Quatmann, Matthias Volk:
Parameter synthesis for Markov models: covering the parameter space. Formal Methods Syst. Des. 62(1): 181-259 (2024) - [j103]Krishnendu Chatterjee, Joost-Pieter Katoen, Stefanie Mohr, Maximilian Weininger, Tobias Winkler:
Stochastic games with lexicographic objectives. Formal Methods Syst. Des. 63(1): 40-80 (2024) - [j102]Lutz Klinkenberg, Christian Blumenthal, Mingshuai Chen, Darion Haase, Joost-Pieter Katoen:
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions. Proc. ACM Program. Lang. 8(OOPSLA1): 923-953 (2024) - [j101]Kevin Batz, Tom Jannik Biskup, Joost-Pieter Katoen, Tobias Winkler:
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs. Proc. ACM Program. Lang. 8(POPL): 2792-2820 (2024) - [j100]Shahid Khan, Joost-Pieter Katoen, Marc Bouissou:
A Compositional Semantics of Boolean-Logic Driven Markov Processes. IEEE Trans. Dependable Secur. Comput. 21(2): 701-716 (2024) - 2023
- [j99]Bahare Salmani, Joost-Pieter Katoen:
Automatically Finding the Right Probabilities in Bayesian Networks. J. Artif. Intell. Res. 77: 1637-1696 (2023) - [j98]Tobias Winkler, Christina Gehnen, Joost-Pieter Katoen:
Model Checking Temporal Properties of Recursive Probabilistic Programs. Log. Methods Comput. Sci. 19(4) (2023) - [j97]Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan:
Lower Bounds for Possibly Divergent Probabilistic Programs. Proc. ACM Program. Lang. 7(OOPSLA1): 696-726 (2023) - [j96]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs. Proc. ACM Program. Lang. 7(OOPSLA2): 2052-2082 (2023) - [j95]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht:
A Calculus for Amortized Expected Runtimes. Proc. ACM Program. Lang. 7(POPL): 1957-1986 (2023) - [j94]Joost-Pieter Katoen:
Conference Reports. ACM SIGLOG News 10(4): 41 (2023) - 2022
- [j93]Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen, Saba Aflaki:
Synthesizing optimal bias in randomized self-stabilization. Distributed Comput. 35(1): 37-57 (2022) - [j92]Tim Quatmann, Sebastian Junges, Joost-Pieter Katoen:
Markov automata with multiple objectives. Formal Methods Syst. Des. 60(1): 33-86 (2022) - [j91]Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
The probabilistic termination tool amber. Formal Methods Syst. Des. 61(1): 90-109 (2022) - [j90]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming. Inf. Comput. 289(Part): 104965 (2022) - [j89]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. J. ACM 69(6): 46:1-46:52 (2022) - [j88]Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler:
Weighted programming: a programming paradigm for specifying mathematical models. Proc. ACM Program. Lang. 6(OOPSLA1): 1-30 (2022) - [j87]Emma Ahrens, Marius Bozga, Radu Iosif, Joost-Pieter Katoen:
Reasoning about distributed reconfigurable systems. Proc. ACM Program. Lang. 6(OOPSLA2): 145-174 (2022) - [j86]Norman Weik, Matthias Volk, Joost-Pieter Katoen, Nils Nießen:
DFT modeling approach for operational risk assessment of railway infrastructure. Int. J. Softw. Tools Technol. Transf. 24(3): 331-350 (2022) - [j85]Christian Hensel, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann, Matthias Volk:
The probabilistic model checker Storm. Int. J. Softw. Tools Technol. Transf. 24(4): 589-610 (2022) - [j84]Thom S. Badings, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Scenario-based verification of uncertain parametric MDPs. Int. J. Softw. Tools Technol. Transf. 24(5): 803-819 (2022) - [j83]Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Convex Optimization for Parameter Synthesis in MDPs. IEEE Trans. Autom. Control. 67(12): 6333-6348 (2022) - 2021
- [j82]Milan Ceska, Christian Hensel, Sebastian Junges, Joost-Pieter Katoen:
Counterexample-guided inductive synthesis for probabilistic systems. Formal Aspects Comput. 33(4-5): 637-667 (2021) - [j81]Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler:
The complexity of reachability in parametric Markov decision processes. J. Comput. Syst. Sci. 119: 183-210 (2021) - [j80]Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A pre-expectation calculus for probabilistic sensitivity. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [j79]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - [j78]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Probabilistic Data with Continuous Distributions. SIGMOD Rec. 50(1): 69-76 (2021) - [j77]Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, Bernd Becker:
Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions. IEEE Trans. Autom. Control. 66(3): 1040-1054 (2021) - 2020
- [j76]Christel Baier, Christian Hensel, Lisa Hutschenreiter, Sebastian Junges, Joost-Pieter Katoen, Joachim Klein:
Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination. Inf. Comput. 272: 104504 (2020) - [j75]Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann:
Multi-cost Bounded Tradeoff Analysis in MDP. J. Autom. Reason. 64(7): 1483-1522 (2020) - [j74]Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen:
Aiming low is harder: induction for lower bounds in probabilistic program verification. Proc. ACM Program. Lang. 4(POPL): 37:1-37:28 (2020) - [j73]Tim Lange, Martin R. Neuhäußer, Thomas Noll, Joost-Pieter Katoen:
IC3 software model checking. Int. J. Softw. Tools Technol. Transf. 22(2): 135-161 (2020) - 2019
- [j72]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
On the hardness of analyzing probabilistic programs. Acta Informatica 56(3): 255-285 (2019) - [j71]Mingzhang Huang, Hongfei Fu, Joost-Pieter Katoen:
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems. Inf. Comput. 268 (2019) - [j70]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll:
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs. Proc. ACM Program. Lang. 3(POPL): 34:1-34:29 (2019) - [j69]Majdi Ghadhab, Sebastian Junges, Joost-Pieter Katoen, Matthias Kuntz, Matthias Volk:
Safety analysis for vehicle guidance systems with dynamic fault trees. Reliab. Eng. Syst. Saf. 186: 37-50 (2019) - 2018
- [j68]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. J. ACM 65(5): 30:1-30:68 (2018) - [j67]Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A new proof rule for almost-sure termination. Proc. ACM Program. Lang. 2(POPL): 33:1-33:28 (2018) - [j66]Matthias Volk, Sebastian Junges, Joost-Pieter Katoen:
Fast Dynamic Fault Tree Analysis by Model Checking Techniques. IEEE Trans. Ind. Informatics 14(1): 370-379 (2018) - [j65]Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver:
Conditioning in Probabilistic Programming. ACM Trans. Program. Lang. Syst. 40(1): 4:1-4:50 (2018) - 2017
- [j64]Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Arend Rensink, Mariëlle Stoelinga:
Fault trees on a diet: automated reduction by graph rewriting. Formal Aspects Comput. 29(4): 651-703 (2017) - [j63]Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, Alessandro Abate:
Quantitative model-checking of controlled discrete-time Markov processes. Inf. Comput. 253: 1-35 (2017) - 2016
- [j62]Luca Aceto, Thomas A. Henzinger, Joost-Pieter Katoen, Wolfgang Thomas, Moshe Y. Vardi:
Viewpoints on "Logic activities in Europe", twenty years later. Bull. EATCS 118 (2016) - [j61]Anton Wijs, Joost-Pieter Katoen, Dragan Bosnacki:
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components. Formal Methods Syst. Des. 48(3): 274-300 (2016) - [j60]Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga:
Confluence reduction for Markov automata. Theor. Comput. Sci. 655: 193-219 (2016) - [j59]Joost-Pieter Katoen, Hao Wu:
Probabilistic Model Checking for Uncertain Scenario-Aware Data Flow. ACM Trans. Design Autom. Electr. Syst. 22(1): 15:1-15:27 (2016) - 2015
- [j58]Ralf Wimmer, Nils Jansen, Andreas Vorpahl, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker:
High-level Counterexamples for Probabilistic Automata. Log. Methods Comput. Sci. 11(1) (2015) - [j57]Jonathan Heinen, Christina Jansen, Joost-Pieter Katoen, Thomas Noll:
Juggrnaut: using graph grammars for abstracting unbounded heap structures. Formal Methods Syst. Des. 47(2): 159-203 (2015) - [j56]Jonathan Heinen, Christina Jansen, Joost-Pieter Katoen, Thomas Noll:
Verifying pointer programs using graph grammars. Sci. Comput. Program. 97: 157-162 (2015) - [j55]Souymodip Chakraborty, Joost-Pieter Katoen, Falak Sher, Martin Strelec:
Modelling and statistical model checking of a microgrid. Int. J. Softw. Tools Technol. Transf. 17(4): 537-554 (2015) - 2014
- [j54]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen, Mark Timmer:
Analysis of Timed and Long-Run Objectives for Markov Automata. Log. Methods Comput. Sci. 10(3) (2014) - [j53]Friedrich Gretz, Joost-Pieter Katoen, Annabelle McIver:
Operational versus weakest pre-expectation semantics for the probabilistic guarded command language. Perform. Evaluation 73: 110-132 (2014) - [j52]Marco Bozzano, Alessandro Cimatti, Joost-Pieter Katoen, Panagiotis Katsaros, Konstantinos Mokos, Viet Yen Nguyen, Thomas Noll, Bart Postma, Marco Roveri:
Spacecraft early design validation using formal methods. Reliab. Eng. Syst. Saf. 132: 20-35 (2014) - [j51]Nils Jansen, Ralf Wimmer, Erika Ábrahám, Barna Zajzon, Joost-Pieter Katoen, Bernd Becker, Johann Schuster:
Symbolic counterexample generation for large discrete-time Markov chains. Sci. Comput. Program. 91: 90-114 (2014) - [j50]Ralf Wimmer, Nils Jansen, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker:
Minimal counterexamples for linear-time probabilistic verification. Theor. Comput. Sci. 549: 61-100 (2014) - 2013
- [j49]Ernst Moritz Hahn, Arnd Hartmanns, Holger Hermanns, Joost-Pieter Katoen:
A compositional modelling and analysis framework for stochastic hybrid systems. Formal Methods Syst. Des. 43(2): 191-232 (2013) - [j48]Benoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, Andrzej Wasowski:
Abstract Probabilistic Automata. Inf. Comput. 232: 66-116 (2013) - [j47]Christel Baier, Ernst Moritz Hahn, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Model checking for performability. Math. Struct. Comput. Sci. 23(4): 751-795 (2013) - 2012
- [j46]Mani Swaminathan, Joost-Pieter Katoen, Ernst-Rüdiger Olderog:
Layered reasoning for randomized distributed algorithms. Formal Aspects Comput. 24(4-6): 477-496 (2012) - [j45]Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf:
Three-valued abstraction for probabilistic systems. J. Log. Algebraic Methods Program. 81(4): 356-389 (2012) - [j44]Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga, Mark Timmer:
A linear process-algebraic format with data for probabilistic automata. Theor. Comput. Sci. 413(1): 36-57 (2012) - 2011
- [j43]Marco Bozzano, Alessandro Cimatti, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll, Marco Roveri:
Safety, Dependability and Performance Analysis of Extended AADL Models. Comput. J. 54(5): 754-775 (2011) - [j42]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. Log. Methods Comput. Sci. 7(1) (2011) - [j41]Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz Hahn, Holger Hermanns, David N. Jansen:
The ins and outs of the probabilistic model checker MRMC. Perform. Evaluation 68(2): 90-104 (2011) - [j40]Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen:
Time-bounded reachability in tree-structured QBDs by abstraction. Perform. Evaluation 68(2): 105-125 (2011) - 2010
- [j39]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Performance evaluation and model checking join forces. Commun. ACM 53(9): 76-85 (2010) - [j38]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker:
SMA - The Smyle Modeling Approach. Comput. Informatics 29(1): 45-72 (2010) - [j37]Alessandro Abate, Joost-Pieter Katoen, John Lygeros, Maria Prandini:
Approximate Model Checking of Stochastic Hybrid Systems. Eur. J. Control 16(6): 624-641 (2010) - [j36]Christel Baier, Lucia Cloth, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Performability assessment by model checking of Markov reward models. Formal Methods Syst. Des. 36(1): 1-36 (2010) - [j35]Marijn R. Jongerden, Alexandru Mereacre, Henrik C. Bohnenkamp, Boudewijn R. Haverkort, Joost-Pieter Katoen:
Computing Optimal Schedules for battery Usage in Embedded Systems. IEEE Trans. Ind. Informatics 6(3): 276-286 (2010) - [j34]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker:
Learning Communicating Automata from MSCs. IEEE Trans. Software Eng. 36(3): 390-408 (2010) - 2009
- [j33]Tingting Han, Joost-Pieter Katoen, Berteun Damman:
Counterexample Generation in Probabilistic Model Checking. IEEE Trans. Software Eng. 35(2): 241-257 (2009) - 2008
- [j32]Joost-Pieter Katoen:
How to model and analyze gossiping protocols? SIGMETRICS Perform. Evaluation Rev. 36(3): 3-6 (2008) - 2007
- [j31]Rocco De Nicola, Joost-Pieter Katoen, Diego Latella, Michele Loreti, Mieke Massink:
Model checking mobile stochastic logic. Theor. Comput. Sci. 382(1): 42-70 (2007) - 2006
- [j30]Peter Buchholz, Joost-Pieter Katoen, Marcel Verhoef:
Guest editors' introduction: quantitative analysis of real-time embedded systems. Int. J. Softw. Tools Technol. Transf. 8(6): 605-606 (2006) - [j29]Giuliana Franceschinis, Joost-Pieter Katoen, C. Murray Woodside:
Guest Editors' Introduction to the Special Section on the First International Conference on the Quantitative Evaluation of SysTems (QEST). IEEE Trans. Software Eng. 32(8): 529-530 (2006) - [j28]Henrik C. Bohnenkamp, Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter Katoen:
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems. IEEE Trans. Software Eng. 32(10): 812-830 (2006) - 2005
- [j27]Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Verena Wolf:
Comparative branching-time semantics for Markov chains. Inf. Comput. 200(2): 149-214 (2005) - [j26]Pedro R. D'Argenio, Joost-Pieter Katoen:
A theory of stochastic systems part I: Stochastic automata. Inf. Comput. 203(1): 1-38 (2005) - [j25]Pedro R. D'Argenio, Joost-Pieter Katoen:
A theory of Stochastic systems. Part II: Process algebra. Inf. Comput. 203(1): 39-74 (2005) - [j24]Boudewijn R. Haverkort, Joost-Pieter Katoen:
Performance and verification. SIGMETRICS Perform. Evaluation Rev. 32(4): 3 (2005) - [j23]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Model checking meets performance evaluation. SIGMETRICS Perform. Evaluation Rev. 32(4): 10-15 (2005) - [j22]Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Boudewijn R. Haverkort:
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theor. Comput. Sci. 345(1): 2-26 (2005) - 2004
- [j21]Christel Baier, Holger Hermanns, Joost-Pieter Katoen:
Probabilistic weak simulation is decidable in polynomial time. Inf. Process. Lett. 89(3): 123-130 (2004) - [j20]Joost-Pieter Katoen, Perdita Stevens:
Guest editors' introduction: Advancements and extensions of verification techniques. Int. J. Softw. Tools Technol. Transf. 6(2): 99-101 (2004) - 2003
- [j19]Peter Buchholz, Joost-Pieter Katoen, Peter Kemper, Carsten Tepper:
Model-checking large structured Markov chains. J. Log. Algebraic Methods Program. 56(1-2): 69-97 (2003) - [j18]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle:
A tool for model-checking Markov chains. Int. J. Softw. Tools Technol. Transf. 4(2): 153-172 (2003) - [j17]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. Software Eng. 29(6): 524-541 (2003) - 2002
- [j16]Holger Hermanns, Joost-Pieter Katoen:
Guest editors' introduction: Model checking in a nutshell. J. Log. Algebraic Methods Program. 52-53: 1-5 (2002) - [j15]Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoen:
Process algebra for performance evaluation. Theor. Comput. Sci. 274(1-2): 43-87 (2002) - [j14]Joost-Pieter Katoen:
Real-Time and Probabilistic Systems - Foreword. Theor. Comput. Sci. 282(1): 1-3 (2002) - 2001
- [j13]Joost-Pieter Katoen, Christel Baier, Diego Latella:
Metric semantics for true concurrent real time. Theor. Comput. Sci. 254(1-2): 501-542 (2001) - 2000
- [j12]Holger Hermanns, Joost-Pieter Katoen:
Automated compositional Markov chain generation for a plain-old telephone system. Sci. Comput. Program. 36(1): 97-127 (2000) - [j11]Joost-Pieter Katoen, Albert Nymeyer:
Pattern-matching algorithms based on term rewrite systems. Theor. Comput. Sci. 238(1-2): 439-464 (2000) - 1998
- [j10]Ed Brinksma, Joost-Pieter Katoen, Rom Langerak, Diego Latella:
Partial Order Models for Quantitative Extensions of LOTOS. Comput. Networks 30(9-10): 925-950 (1998) - [j9]Howard Bowman, Giorgio P. Faconti, Joost-Pieter Katoen, Diego Latella, Mieke Massink:
Automatic Verification of a Lip-Synchronisation Protocol Using Uppaal. Formal Aspects Comput. 10(5-6): 550-575 (1998) - [j8]Joost-Pieter Katoen, Rom Langerak, Ed Brinksma, Diego Latella, Tommaso Bolognesi:
A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions. Formal Methods Syst. Des. 12(2): 189-216 (1998) - 1997
- [j7]Albert Nymeyer, Joost-Pieter Katoen:
Code Generation Based on Formal BURS Therory and Heuristic Search. Acta Informatica 34(8): 597-635 (1997) - 1996
- [j6]Jacob Brunekreef, Joost-Pieter Katoen, Ron Koymans, Sjouke Mauw:
Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks. Distributed Comput. 9(4): 157-171 (1996) - [j5]Joost-Pieter Katoen, Berry Schoenmakers:
Systolic Arrays for the Recognition of Permutation-Invariant Segments. Sci. Comput. Program. 27(2): 119-137 (1996) - 1995
- [j4]Ed Brinksma, Joost-Pieter Katoen, Rom Langerak, Diego Latella:
A Stochastic Causality-Based Process Algebra. Comput. J. 38(7): 552-565 (1995) - [j3]Marten van Sinderen, Luís Ferreira Pires, Chris A. Vissers, Joost-Pieter Katoen:
A Design Model for Open Distributed Processing Systems. Comput. Networks ISDN Syst. 27(8): 1263-1285 (1995) - 1993
- [j2]Joost-Pieter Katoen, Martin Rem:
Recognizing k-Rotated Segments. Int. J. High Speed Comput. 5(2): 293-305 (1993) - 1989
- [j1]C. Hemerik, Joost-Pieter Katoen:
Bottom-Up Tree Acceptors. Sci. Comput. Program. 13(1): 51-72 (1989)
Conference and Workshop Papers
- 2024
- [c257]Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano:
Natural Strategic Ability in Stochastic Multi-Agent Systems. AAAI 2024: 17308-17316 - [c256]Timm Spork, Christel Baier, Joost-Pieter Katoen, Jakob Piribauer, Tim Quatmann:
A Spectrum of Approximate Probabilistic Bisimulations. CONCUR 2024: 37:1-37:19 - [c255]Raphaël Berthon, Joost-Pieter Katoen, Tobias Winkler:
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives. RP 2024: 203-220 - [c254]Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann, Tobias Winkler:
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains. TACAS (2) 2024: 237-257 - 2023
- [c253]Roman Andriushchenko, Alexander Bork, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Search and Explore: Symbiotic Policy Synthesis in POMDPs. CAV (3) 2023: 113-135 - [c252]Bahare Salmani, Joost-Pieter Katoen:
Finding an ϵ-Close Minimal Variation of Parameters in Bayesian Networks. IJCAI 2023: 5720-5729 - [c251]Tobias Winkler, Joost-Pieter Katoen:
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata. LICS 2023: 1-13 - [c250]Tobias Winkler, Joost-Pieter Katoen:
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration. TACAS (2) 2023: 391-409 - [c249]Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants. TACAS (2) 2023: 410-429 - 2022
- [c248]Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Parameter Synthesis in Markov Models: A Gentle Survey. Principles of Systems Design 2022: 407-437 - [c247]Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg, Tobias Winkler:
Does a Program Yield the Right Distribution? - Verifying Probabilistic Programs via Generating Functions. CAV (1) 2022: 79-101 - [c246]Ira Fesefeldt, Joost-Pieter Katoen, Thomas Noll:
Towards Concurrent Quantitative Separation Logic. CONCUR 2022: 25:1-25:24 - [c245]Kevin Batz, Ira Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Keßler, Christoph Matheja, Thomas Noll:
Foundations for Entailment Checking in Quantitative Separation Logic. ESOP 2022: 57-84 - [c244]Tobias Winkler, Christina Gehnen, Joost-Pieter Katoen:
Model Checking Temporal Properties of Recursive Probabilistic Programs. FoSSaCS 2022: 449-469 - [c243]Xaver Fink, Philipp Berger, Joost-Pieter Katoen:
Configurable Benchmarks for C Model Checkers. NFM 2022: 338-354 - [c242]Daniel Basgöze, Matthias Volk, Joost-Pieter Katoen, Shahid Khan, Mariëlle Stoelinga:
BDDs Strike Back - Efficient Analysis of Static and Dynamic Fault Trees. NFM 2022: 713-732 - [c241]Jip Spel, Svenja Stein, Joost-Pieter Katoen:
POMDP Controllers with Optimal Budget. QEST 2022: 107-130 - [c240]Alexander Bork, Joost-Pieter Katoen, Tim Quatmann:
Under-Approximating Expected Total Rewards in POMDPs. TACAS (2) 2022: 22-40 - [c239]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen:
Inductive synthesis of finite-state controllers for POMDPs. UAI 2022: 85-95 - [c238]Linus Heck, Jip Spel, Sebastian Junges, Joshua Moerman, Joost-Pieter Katoen:
Gradient-Descent for Randomized Controllers Under Partial Observability. VMCAI 2022: 127-150 - [c237]Tobias Winkler, Johannes Lehmann, Joost-Pieter Katoen:
Out of Control: Reducing Probabilistic Models by Control-State Elimination. VMCAI 2022: 450-472 - 2021
- [c236]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming. CAV (1) 2021: 443-466 - [c235]Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
Latticed k-Induction with an Application to Probabilistic Programs. CAV (2) 2021: 524-549 - [c234]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Simon Stupinský:
PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs. CAV (1) 2021: 856-869 - [c233]Shahid Khan, Matthias Volk, Joost-Pieter Katoen, Alexis Braibant, Marc Bouissou:
Model Checking the Multi-Formalism Language FIGARO. DSN 2021: 463-470 - [c232]Bahare Salmani, Joost-Pieter Katoen:
Fine-Tuning the Odds in Bayesian Networks. ECSQARU 2021: 268-283 - [c231]Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
Automated Termination Analysis of Polynomial Probabilistic Programs. ESOP 2021: 491-518 - [c230]Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
The Probabilistic Termination Tool Amber. FM 2021: 667-675 - [c229]Shahid Khan, Joost-Pieter Katoen, Matthias Volk, Muhammad Ahmad Zafar, Falak Sher:
Modelling and Analysis of Fire Sprinklers by Verifying Dynamic Fault Trees. LADC 2021: 1-10 - [c228]Shahid Khan, Joost-Pieter Katoen, Matthias Volk, Marc Bouissou:
Scalable Reliability Analysis by Lazy Verification. NFM 2021: 180-197 - [c227]Shahid Khan, Joost-Pieter Katoen:
Synergising Reliability Modelling Languages: BDMPs and Repairable DFTs. PRDC 2021: 113-122 - [c226]Arnd Hartmanns, Joost-Pieter Katoen, Bram Kohlen, Jip Spel:
Tweaking the Odds in Probabilistic Timed Automata. QEST 2021: 39-58 - [c225]Jip Spel, Sebastian Junges, Joost-Pieter Katoen:
Finding Provably Optimal Markov Chains. TACAS (1) 2021: 173-190 - [c224]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen:
Inductive Synthesis for Probabilistic Programs Reaches New Horizons. TACAS (1) 2021: 191-209 - [c223]Tim Quatmann, Joost-Pieter Katoen:
Multi-objective Optimization of Long-run Average and Total Rewards. TACAS (1) 2021: 230-249 - 2020
- [c222]Alexander Bork, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann:
Verification of Indefinite-Horizon POMDPs. ATVA 2020: 288-304 - [c221]Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler:
Stochastic Games with Lexicographic Reachability-Safety Objectives. CAV (2) 2020: 398-420 - [c220]Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
PrIC3: Property Directed Reachability for MDPs. CAV (2) 2020: 512-538 - [c219]Shahid Khan, Joost-Pieter Katoen, Marc Bouissou:
Explaining Boolean-Logic Driven Markov Processes using GSPNs. EDCC 2020: 119-126 - [c218]Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler:
Generating Functions for Probabilistic Programs. LOPSTR 2020: 231-248 - [c217]Lukas Westhofen, Philipp Berger, Joost-Pieter Katoen:
Benchmarking Software Model Checkers on Automotive Code. NFM 2020: 133-150 - [c216]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. PODS 2020: 347-360 - [c215]Mojgan Kamali, Joost-Pieter Katoen:
Probabilistic Model Checking of AODV. QEST 2020: 54-73 - [c214]Bahare Salmani, Joost-Pieter Katoen:
Bayesian Inference by Symbolic Model Checking. QEST 2020: 115-133 - [c213]Shahid Khan, Joost-Pieter Katoen, Marc Bouissou:
A Compositional Semantics for Repairable BDMPs. SAFECOMP 2020: 82-98 - [c212]Jan Svejda, Philipp Berger, Joost-Pieter Katoen:
Interpretation-Based Violation Witness Validation for C: NITWIT. TACAS (1) 2020: 40-57 - [c211]Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Scenario-Based Verification of Uncertain MDPs. TACAS (1) 2020: 287-305 - [c210]Florent Delgrange, Joost-Pieter Katoen, Tim Quatmann, Mickael Randour:
Simple Strategies in Multi-Objective MDPs. TACAS (1) 2020: 346-364 - [c209]Marc Bouissou, Shahid Khan, Joost-Pieter Katoen, Pavel Krcál:
Various Ways to Quantify BDMPs. MARS@ETAPS 2020: 1-14 - 2019
- [c208]Jip Spel, Sebastian Junges, Joost-Pieter Katoen:
Are Parametric Markov Chains Monotonic? ATVA 2019: 479-496 - [c207]Milan Ceska, Christian Dehnert, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Model Repair Revamped - - On the Automated Synthesis of Markov Chains -. From Reactive Systems to Cyber-Physical Systems 2019: 107-125 - [c206]Tobias Winkler, Sebastian Junges, Guillermo A. Pérez, Joost-Pieter Katoen:
On the Complexity of Reachability in Parametric Markov Decision Processes. CONCUR 2019: 14:1-14:17 - [c205]Milan Ceska, Christian Hensel, Sebastian Junges, Joost-Pieter Katoen:
Counterexample-Driven Synthesis for Probabilistic Program Sketches. FM 2019: 101-120 - [c204]Matthias Volk, Norman Weik, Joost-Pieter Katoen, Nils Nießen:
A DFT Modeling Approach for Infrastructure Reliability Analysis of Railway Station Areas. FMICS 2019: 40-58 - [c203]Philipp Berger, Johanna Nellen, Joost-Pieter Katoen, Erika Ábrahám, Md Tawhid Bin Waez, Thomas Rambow:
Multiple Analyses, Requirements Once: - Simplifying Testing and Verification in Automotive Model-Based Development. FMICS 2019: 59-75 - [c202]Shahid Khan, Joost-Pieter Katoen, Matthias Volk, Marc Bouissou:
Synergizing Reliability Modeling Languages: BDMPs without Repairs and DFTs. PRDC 2019: 266-275 - [c201]Yassmeen Elderhalli, Matthias Volk, Osman Hasan, Joost-Pieter Katoen, Sofiène Tahar:
Formal Verification of Rewriting Rules for Dynamic Fault Trees. SEFM 2019: 513-531 - [c200]Marcin Szymczak, Joost-Pieter Katoen:
Weakest Preexpectation Semantics for Bayesian Inference - Conditioning, Continuous Distributions and Divergence. SETSS 2019: 44-121 - [c199]Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann, Bernd Becker, Ralf Wimmer, Leonore Winterer:
Correct-by-construction policies for POMDPs. SNR 2019: 6-8 - [c198]Milan Ceska, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Shepherding Hordes of Markov Chains. TACAS (2) 2019: 172-190 - [c197]Marco Bozzano, Harold Bruintjes, Alessandro Cimatti, Joost-Pieter Katoen, Thomas Noll, Stefano Tonetta:
COMPASS 3.0. TACAS (1) 2019: 379-385 - 2018
- [c196]Sebastian Junges, Joost-Pieter Katoen, Mariëlle Stoelinga, Matthias Volk:
One Net Fits All - A Unifying Semantics of Dynamic Fault Trees Using GSPNs. Petri Nets 2018: 272-293 - [c195]Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Synthesis in pMDPs: A Tale of 1001 Parameters. ATVA 2018: 160-176 - [c194]Hannah Arndt, Christina Jansen, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll:
Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs. CAV (2) 2018: 3-11 - [c193]Yijun Feng, Joost-Pieter Katoen, Haokun Li, Bican Xia, Naijun Zhan:
Monitoring CTMCs by Multi-clock Timed Automata. CAV (1) 2018: 507-526 - [c192]Tim Quatmann, Joost-Pieter Katoen:
Sound Value Iteration. CAV (1) 2018: 643-661 - [c191]Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, Gaoang Liu, Hao Wu:
Branching Bisimulation and Concurrent Object Verification. DSN 2018: 267-278 - [c190]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling times. ESOP 2018: 186-213 - [c189]Philipp Berger, Joost-Pieter Katoen, Erika Ábrahám, Md Tawhid Bin Waez, Thomas Rambow:
Verifying Auto-generated C Code from Simulink - An Experience Report in the Automotive Domain. FM 2018: 312-328 - [c188]Johanna Nellen, Thomas Rambow, Md Tawhid Bin Waez, Erika Ábrahám, Joost-Pieter Katoen:
Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations. FM 2018: 382-398 - [c187]Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, Bernd Becker:
Abstraktions-basierte Verifikation von POMDPs im Motion-Planning-Kontext. MBMV 2018 - [c186]Sebastian Arming, Ezio Bartocci, Krishnendu Chatterjee, Joost-Pieter Katoen, Ana Sokolova:
Parameter-Independent Strategies for pMDPs via POMDPs. QEST 2018: 53-70 - [c185]Sebastian Junges, Nils Jansen, Joost-Pieter Katoen, Ufuk Topcu, Ruohan Zhang, Mary M. Hayhoe:
Model Checking for Safe Navigation Among Humans. QEST 2018: 207-222 - [c184]Tim Lange, Frederick Prinz, Martin R. Neuhäußer, Thomas Noll, Joost-Pieter Katoen:
Improving Generalization in Software IC3. SPIN 2018: 85-102 - [c183]Maurice van Keulen, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen:
Rule-Based Conditioning of Probabilistic Data. SUM 2018: 290-305 - [c182]Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann:
Multi-cost Bounded Reachability in MDP. TACAS (2) 2018: 320-339 - [c181]Sebastian Junges, Nils Jansen, Ralf Wimmer, Tim Quatmann, Leonore Winterer, Joost-Pieter Katoen, Bernd Becker:
Finite-State Controllers of POMDPs using Parameter Synthesis. UAI 2018: 519-529 - 2017
- [c180]Joost-Pieter Katoen, Mariëlle Stoelinga:
Boosting Fault Tree Analysis by Formal Methods. ModelEd, TestEd, TrustEd 2017: 368-389 - [c179]Joost-Pieter Katoen, Falak Sher:
Modal Stochastic Games - Abstraction-Refinement of Probabilistic Automata. Models, Algorithms, Logics and Tools 2017: 426-445 - [c178]Tim Quatmann, Sebastian Junges, Joost-Pieter Katoen:
Markov Automata with Multiple Objectives. CAV (1) 2017: 140-159 - [c177]Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen, Matthias Volk:
A Storm is Coming: A Modern Probabilistic Model Checker. CAV (2) 2017: 592-600 - [c176]Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, Bernd Becker:
Motion planning under partial observability using game-based abstraction. CDC 2017: 2201-2208 - [c175]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A weakest pre-expectation semantics for mixed-sign expectations. LICS 2017: 1-12 - [c174]Majdi Ghadhab, Sebastian Junges, Joost-Pieter Katoen, Matthias Kuntz, Matthias Volk:
Model-Based Safety Analysis for Vehicle Guidance Systems. SAFECOMP 2017: 3-19 - [c173]Saba Aflaki, Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen, Arne Storjohann:
Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms. SRDS 2017: 94-103 - [c172]Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ivan Papusha, Hasan A. Poonawala, Ufuk Topcu:
Sequential Convex Programming for the Efficient Verification of Parametric MDPs. TACAS (2) 2017: 133-150 - 2016
- [c171]Sebastian Junges, Nils Jansen, Joost-Pieter Katoen, Ufuk Topcu:
Probabilistic Verification for Cognitive Models. AAAI Fall Symposia 2016 - [c170]Tim Quatmann, Christian Dehnert, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Parameter Synthesis for Markov Models: Faster Than Ever. ATVA 2016: 50-67 - [c169]Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen:
Bounded Model Checking for Probabilistic Programs. ATVA 2016: 68-85 - [c168]Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Mariëlle Stoelinga:
Uncovering Dynamic Fault Trees. DSN 2016: 299-310 - [c167]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. ESOP 2016: 364-389 - [c166]Joost-Pieter Katoen:
The Probabilistic Model Checking Landscape. LICS 2016: 31-45 - [c165]Souymodip Chakraborty, Joost-Pieter Katoen:
On the Satisfiability of Some Simple Probabilistic Logics. LICS 2016: 56-65 - [c164]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. LICS 2016: 672-681 - [c163]Christian Dehnert, Sebastian Junges, Nils Jansen, Florian Corzilius, Matthias Volk, Joost-Pieter Katoen, Erika Ábrahám, Harold Bruintjes:
Parameter Synthesis for Probabilistic Systems. MBMV 2016: 72-74 - [c162]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Inferring Covariances for Probabilistic Programs. QEST 2016: 191-206 - [c161]Matthias Volk, Sebastian Junges, Joost-Pieter Katoen:
Advancing Dynamic Fault Tree Analysis - Get Succinct State Spaces Fast and Synthesise Failure Rates. SAFECOMP 2016: 253-265 - [c160]Hao Wu, Xiaoxiao Yang, Joost-Pieter Katoen:
Performance Evaluation of Concurrent Data Structures. SETTA 2016: 38-49 - [c159]Christian Dombrowski, Sebastian Junges, Joost-Pieter Katoen, James Gross:
Model-Checking Assisted Protocol Design for Ultra-reliable Low-Latency Wireless Networks. SRDS 2016: 307-316 - [c158]Sebastian Junges, Nils Jansen, Christian Dehnert, Ufuk Topcu, Joost-Pieter Katoen:
Safety-Constrained Reinforcement Learning for MDPs. TACAS 2016: 130-146 - 2015
- [c157]Souymodip Chakraborty, Joost-Pieter Katoen:
Model Checking of Open Interval Markov Chains. ASMTA 2015: 30-42 - [c156]Joost-Pieter Katoen:
Probabilistic Programming: A True Verification Challenge. ATVA 2015: 1-3 - [c155]Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Federico Olmedo:
Understanding Probabilistic Programs. Correct System Design 2015: 15-32 - [c154]Christian Dehnert, Sebastian Junges, Nils Jansen, Florian Corzilius, Matthias Volk, Harold Bruintjes, Joost-Pieter Katoen, Erika Ábrahám:
PROPhESY: A PRObabilistic ParamEter SYnthesis Tool. CAV (1) 2015: 214-231 - [c153]Harold Bruintjes, Joost-Pieter Katoen, David Lesens:
A Statistical Approach for Timed Reachability in AADL Models. DSN 2015: 81-88 - [c152]Tim Quatmann, Nils Jansen, Christian Dehnert, Ralf Wimmer, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker:
Counterexamples for Expected Rewards. FM 2015: 435-452 - [c151]Martin Fränzle, Sebastian Gerwinn, Paul Kröger, Alessandro Abate, Joost-Pieter Katoen:
Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems. FORMATS 2015: 93-107 - [c150]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
On the Hardness of Almost-Sure Termination. MFCS (1) 2015: 307-318 - [c149]Shashank Pathak, Erika Ábrahám, Nils Jansen, Armando Tacchella, Joost-Pieter Katoen:
A Greedy Approach for the Efficient Repair of Stochastic Models. NFM 2015: 295-309 - [c148]Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Arend Rensink, Mariëlle Stoelinga:
Fault Trees on a Diet - - Automated Reduction by Graph Rewriting -. SETTA 2015: 3-18 - [c147]Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver:
Conditioning in Probabilistic Programming. MFPS 2015: 199-216 - 2014
- [c146]Arpit Sharma, Joost-Pieter Katoen:
Layered Reduction for Abstract Probabilistic Automata. ACSD 2014: 21-31 - [c145]Christian Dehnert, Nils Jansen, Ralf Wimmer, Erika Ábrahám, Joost-Pieter Katoen:
Fast Debugging of PRISM Models. ATVA 2014: 146-162 - [c144]Anton Wijs, Joost-Pieter Katoen, Dragan Bosnacki:
GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components. CAV 2014: 310-326 - [c143]Falak Sher Vira, Joost-Pieter Katoen:
Tight Game Abstractions of Probabilistic Automata. CONCUR 2014: 576-591 - [c142]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-reachability in probabilistic multi-counter automata. CSL-LICS 2014: 22:1-22:10 - [c141]Joost-Pieter Katoen, Lei Song, Lijun Zhang:
Probably safe or live. CSL-LICS 2014: 55:1-55:10 - [c140]Joost-Pieter Katoen, Hao Wu:
Exponentially timed SADF: Compositional semantics, reductions, and analysis. EMSOFT 2014: 1:1-1:10 - [c139]Viet Yen Nguyen, Benjamin Bittner, Joost-Pieter Katoen, Thomas Noll:
Compositional Analysis Using Component-Oriented Interpolation. FACS 2014: 68-85 - [c138]Souymodip Chakraborty, Joost-Pieter Katoen:
Parametric LTL on Markov Chains. IFIP TCS 2014: 207-221 - [c137]Joost-Pieter Katoen, Thomas Noll, Thomas Santen, Dirk Seifert, Hao Wu:
Performance Analysis of Computing Servers - A Case Study Exploiting a New GSPN Semantics. MMB/DFT 2014: 57-72 - [c136]Nils Jansen, Florian Corzilius, Matthias Volk, Ralf Wimmer, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker:
Accelerating Parametric Probabilistic Verification. QEST 2014: 404-420 - [c135]Erika Ábrahám, Bernd Becker, Christian Dehnert, Nils Jansen, Joost-Pieter Katoen, Ralf Wimmer:
Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey. SFM 2014: 65-121 - 2013
- [c134]Christian Eisentraut, Holger Hermanns, Joost-Pieter Katoen, Lijun Zhang:
A Semantics for Every GSPN. Petri Nets 2013: 90-109 - [c133]Joost-Pieter Katoen:
Concurrency Meets Probability: Theory and Practice - (Abstract). CONCUR 2013: 44-45 - [c132]Joost-Pieter Katoen, Thomas Noll, Hao Wu, Thomas Santen, Dirk Seifert:
Model-based energy optimization of automotive control systems. DATE 2013: 761-766 - [c131]Joost-Pieter Katoen, Doron A. Peled:
Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems. ESOP 2013: 411-430 - [c130]Arpit Sharma, Joost-Pieter Katoen:
Layered Reduction for Modal Specification Theories. FACS 2013: 329-347 - [c129]Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, Alessandro Abate:
Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems. HSCC 2013: 293-302 - [c128]Ralf Wimmer, Nils Jansen, Andreas Vorpahl, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker:
High-Level Counterexamples for Probabilistic Automata. QEST 2013: 39-54 - [c127]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen, Mark Timmer:
Modelling, Reduction and Analysis of Markov Automata. QEST 2013: 55-71 - [c126]Friedrich Gretz, Joost-Pieter Katoen, Annabelle McIver:
Prinsys - On a Quest for Probabilistic Loop Invariants. QEST 2013: 193-208 - [c125]Christian Dehnert, Joost-Pieter Katoen, David Parker:
SMT-Based Bisimulation Minimisation of Markov Models. VMCAI 2013: 28-47 - 2012
- [c124]Joost-Pieter Katoen:
GSPNs Revisited: Simple Semantics and New Analysis Algorithms. ACSD 2012: 6-11 - [c123]Nils Jansen, Erika Ábrahám, Matthias Volk, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker:
The COMICS Tool - Computing Minimal Counterexamples for DTMCs. ATVA 2012: 349-353 - [c122]Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga:
Efficient Modelling and Generation of Markov Automata. CONCUR 2012: 364-379 - [c121]Bart D. Theelen, Joost-Pieter Katoen, Hao Wu:
Model checking of Scenario-Aware Dataflow with CADP. DATE 2012: 653-658 - [c120]Nils Jansen, Erika Ábrahám, Barna Zajzon, Ralf Wimmer, Johann Schuster, Joost-Pieter Katoen, Bernd Becker:
Symbolic Counterexample Generation for Discrete-Time Markov Chains. FACS 2012: 134-151 - [c119]Alessandro D'Innocenzo, Alessandro Abate, Joost-Pieter Katoen:
Robust PCTL model checking. HSCC 2012: 275-286 - [c118]Marie-Aude Esteve, Joost-Pieter Katoen, Viet Yen Nguyen, Bart Postma, Yuri Yushtein:
Formal correctness, safety, dependability, and performance analysis of a satellite. ICSE 2012: 1022-1031 - [c117]Falak Sher, Joost-Pieter Katoen:
Compositional Abstraction Techniques for Probabilistic Automata. IFIP TCS 2012: 325-341 - [c116]Joost-Pieter Katoen, Kim Guldstrand Larsen:
Quantitative Modelling and Analysis. ISoLA (2) 2012: 290-292 - [c115]Ralf Wimmer, Bernd Becker, Nils Jansen, Erika Ábrahám, Joost-Pieter Katoen:
Minimal Critical Subsystems as Counterexamples for omega-Regular DTMC Properties. MBMV 2012: 169-180 - [c114]Dennis Guck, Tingting Han, Joost-Pieter Katoen, Martin R. Neuhäußer:
Quantitative Timed Analysis of Interactive Markov Chains. NASA Formal Methods 2012: 8-23 - [c113]Friedrich Gretz, Joost-Pieter Katoen, Annabelle McIver:
Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language. QEST 2012: 168-177 - [c112]Ralf Wimmer, Nils Jansen, Erika Ábrahám, Bernd Becker, Joost-Pieter Katoen:
Minimal Critical Subsystems for Discrete-Time Markov Models. TACAS 2012: 299-314 - 2011
- [c111]Benoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, Andrzej Wasowski:
New Results on Abstract Probabilistic Automata. ACSD 2011: 118-127 - [c110]Nils Jansen, Erika Ábrahám, Jens Katelaan, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker:
Hierarchical Counterexamples for Discrete-Time Markov Chains. ATVA 2011: 443-452 - [c109]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Reachability probabilities in Markovian Timed Automata. CDC/ECC 2011: 7075-7080 - [c108]Arpit Sharma, Joost-Pieter Katoen:
Weighted Lumpability on Markov Chains. Ershov Memorial Conference 2011: 322-339 - [c107]Joost-Pieter Katoen:
Towards Trustworthy Aerospace Systems: An Experience Report. FMICS 2011: 1-4 - [c106]Joost-Pieter Katoen:
Model Checking: One Can Do Much More Than You Think! FSEN 2011: 1-14 - [c105]Hongfei Fu, Joost-Pieter Katoen:
Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. FSTTCS 2011: 445-456 - [c104]Alessandro Abate, Joost-Pieter Katoen, Alexandru Mereacre:
Quantitative automata model checking of autonomous stochastic hybrid systems. HSCC 2011: 83-92 - [c103]Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll:
A Local Greibach Normal Form for Hyperedge Replacement Grammars. LATA 2011: 323-335 - [c102]Haidi Yue, Henrik C. Bohnenkamp, Malte Kampschulte, Joost-Pieter Katoen:
Analysing and Improving Energy Efficiency of Distributed Slotted Aloha. NEW2AN 2011: 197-208 - [c101]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Observing Continuous-Time MDPs by 1-Clock Timed Automata. RP 2011: 2-25 - [c100]Benoît Barbot, Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Efficient CTMC Model Checking of Linear Real-Time Objectives. TACAS 2011: 128-142 - [c99]Benoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, Andrzej Wasowski:
Abstract Probabilistic Automata. VMCAI 2011: 324-339 - 2010
- [c98]Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga, Mark Timmer:
A Linear Process-Algebraic Format for Probabilistic Systems with Data. ACSD 2010: 213-222 - [c97]Haidi Yue, Joost-Pieter Katoen:
Leader Election in Anonymous Radio Networks: Model Checking Energy Consumption. ASMTA 2010: 247-261 - [c96]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, David R. Piegdon:
libalf: The Automata Learning Framework. CAV 2010: 360-364 - [c95]Marco Bozzano, Alessandro Cimatti, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll, Marco Roveri, Ralf Wimmer:
A Model Checker for AADL. CAV 2010: 562-565 - [c94]Falko Dulat, Joost-Pieter Katoen, Viet Yen Nguyen:
Model Checking Markov Chains Using Krylov Subspace Methods: An Experience Report. EPEW 2010: 115-130 - [c93]Boudewijn R. Haverkort, Joost-Pieter Katoen, Kim G. Larsen:
Quantitative Verification in Practice. ISoLA (2) 2010: 127 - [c92]Haidi Yue, Henrik C. Bohnenkamp, Joost-Pieter Katoen:
Analyzing Energy Consumption in a Gossiping MAC Protocol. MMB/DFT 2010: 107-119 - [c91]Erika Ábrahám, Nils Jansen, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker:
DTMC Model Checking by SCC Reduction. QEST 2010: 37-46 - [c90]Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, Carroll C. Morgan:
Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods. SAS 2010: 390-406 - [c89]Joost-Pieter Katoen:
Advances in Probabilistic Model Checking. VMCAI 2010: 25 - 2009
- [c88]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
LTL Model Checking of Time-Inhomogeneous Markov Chains. ATVA 2009: 104-119 - [c87]Marijn R. Jongerden, Boudewijn R. Haverkort, Henrik C. Bohnenkamp, Joost-Pieter Katoen:
Maximizing system lifetime by battery scheduling. DSN 2009: 63-72 - [c86]Holger Hermanns, Joost-Pieter Katoen:
The How and Why of Interactive Markov Chains. FMCO 2009: 311-337 - [c85]Joost-Pieter Katoen, Daniel Klink, Martin R. Neuhäußer:
Compositional Abstraction for Stochastic Systems. FORMATS 2009: 195-211 - [c84]Martin R. Neuhäußer, Mariëlle Stoelinga, Joost-Pieter Katoen:
Delayed Nondeterminism in Continuous-Time Markov Decision Processes. FoSSaCS 2009: 364-379 - [c83]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. LICS 2009: 309-318 - [c82]Marco Bozzano, Alessandro Cimatti, Marco Roveri, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll:
Codesign of dependable systems: A component-based modeling language. MEMOCODE 2009: 121-130 - [c81]Marco Bozzano, Alessandro Cimatti, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll, Marco Roveri:
Model-Based Codesign of Critical Embedded Systems. ACES-MB@MoDELS 2009 - [c80]Joost-Pieter Katoen, Ivan S. Zapreev:
Simulation-Based CTMC Model Checking: An Empirical Evaluation. QEST 2009: 31-40 - [c79]Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen:
Time-Bounded Reachability in Tree-Structured QBDs by Abstraction. QEST 2009: 133-142 - [c78]Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz Hahn, Holger Hermanns, David N. Jansen:
The Ins and Outs of the Probabilistic Model Checker MRMC. QEST 2009: 167-176 - [c77]Marco Bozzano, Alessandro Cimatti, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll, Marco Roveri:
The COMPASS Approach: Correctness, Modelling and Performability of Aerospace Systems. SAFECOMP 2009: 173-186 - [c76]Marco Bozzano, Alessandro Cimatti, Marco Roveri, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll:
Verification and performance evaluation of aadl models. ESEC/SIGSOFT FSE 2009: 285-286 - 2008
- [c75]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Reachability in continuous-time Markov reward decision processes. Logic and Automata 2008: 53-72 - [c74]Manuela-Luminita Bujorianu, Joost-Pieter Katoen:
Symmetry reduction for stochastic hybrid systems. CDC 2008: 233-238 - [c73]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker:
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR 2008: 162-166 - [c72]Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf:
Abstraction for Stochastic Systems by Erlang's Method of Stages. CONCUR 2008: 279-294 - [c71]Joost-Pieter Katoen:
Quantitative Evaluation in Embedded System Design: Trends in Modeling and Analysis Techniques. DATE 2008: 86-87 - [c70]Joost-Pieter Katoen, Alexandru Mereacre:
Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains. FORMATS 2008: 203-217 - [c69]Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains. HSCC 2008: 244-258 - [c68]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker:
SMA - The Smyle Modeling Approach. CEE-SET 2008: 103-117 - [c67]Mani Swaminathan, Martin Fränzle, Joost-Pieter Katoen:
The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. IFIP TCS 2008: 537-553 - [c66]Berteun Damman, Tingting Han, Joost-Pieter Katoen:
Regular Expressions for PCTL Counterexamples. QEST 2008: 179-188 - [c65]Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Approximate Parameter Synthesis for Probabilistic Time-Bounded Reachability. RTSS 2008: 173-182 - [c64]Joost-Pieter Katoen:
Perspectives in Probabilistic Verification. TASE 2008: 3-10 - [c63]Taolue Chen, Tingting Han, Joost-Pieter Katoen:
Time-Abstracting Bisimulation for Probabilistic Timed Automata. TASE 2008: 177-184 - 2007
- [c62]Tingting Han, Joost-Pieter Katoen:
Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking. ATVA 2007: 331-346 - [c61]Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf:
Three-Valued Abstraction for Continuous-Time Markov Chains. CAV 2007: 311-324 - [c60]Martin R. Neuhäußer, Joost-Pieter Katoen:
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes. CONCUR 2007: 412-427 - [c59]Joost-Pieter Katoen:
Abstraction of Probabilistic Systems. FORMATS 2007: 1-3 - [c58]David N. Jansen, Joost-Pieter Katoen, Marcel Oldenkamp, Mariëlle Stoelinga, Ivan S. Zapreev:
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison. Haifa Verification Conference 2007: 69-85 - [c57]Tingting Han, Joost-Pieter Katoen:
Counterexamples in Probabilistic Model Checking. TACAS 2007: 72-86 - [c56]Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, David N. Jansen:
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking. TACAS 2007: 87-101 - [c55]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker:
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. TACAS 2007: 435-450 - [c54]Henrik C. Bohnenkamp, Holger Hermanns, Joost-Pieter Katoen:
motor: The modestTool Environment. TACAS 2007: 500-504 - 2006
- [c53]Joost-Pieter Katoen, Ivan S. Zapreev:
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability. QEST 2006: 301-310 - [c52]Jasper Berendsen, David N. Jansen, Joost-Pieter Katoen:
Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata. QEST 2006: 311-322 - 2005
- [c51]Henrik C. Bohnenkamp, Johan Gorter, Jarno Guidi, Joost-Pieter Katoen:
Are You Still There? - A Lightweight Algorithm to Monitor Node Presence in Self-Configuring Networks. DSN 2005: 704-709 - [c50]Lucia Cloth, Joost-Pieter Katoen, Maneesh Khattri, Reza Pulungan:
Model Checking Markov Reward Models with Impulse Rewards. DSN 2005: 722-731 - [c49]Dino Distefano, Joost-Pieter Katoen, Arend Rensink:
Safety and Liveness in Concurrent Pointer Programs. FMCO 2005: 280-312 - [c48]Joost-Pieter Katoen, Maneesh Khattri, Ivan S. Zapreev:
A Markov Reward Model Checker. QEST 2005: 243-244 - [c47]Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf:
Bisimulation and Simulation Relations for Markov Chains. APC 25 2005: 73-78 - [c46]Mario Bravetti, Holger Hermanns, Joost-Pieter Katoen:
YMCA: - Why Markov Chain Algebra? - . APC 25 2005: 107-112 - [c45]Rocco De Nicola, Joost-Pieter Katoen, Diego Latella, Mieke Massink:
Towards a Logic for Performance and Mobility. QAPL 2005: 161-175 - 2004
- [c44]Joost-Pieter Katoen:
Labelled Transition Systems. Model-Based Testing of Reactive Systems 2004: 615-616 - [c43]Mieke Massink, Joost-Pieter Katoen, Diego Latella:
Model Checking Dependability Attributes of Wireless Group Communication. DSN 2004: 711-720 - [c42]Dino Distefano, Joost-Pieter Katoen, Arend Rensink:
Who is Pointing When to Whom? FSTTCS 2004: 250-262 - [c41]Henrik C. Bohnenkamp, Holger Hermanns, David N. Jansen, Joost-Pieter Katoen, Yaroslav S. Usenko:
An industrial-strength formal method -- A Modest survey. ISoLA (Preliminary proceedings) 2004: 284-295 - [c40]Joost-Pieter Katoen, Henrik C. Bohnenkamp, Ric Klaren, Holger Hermanns:
Embedded Software Analysis with MOTOR. SFM 2004: 268-294 - [c39]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes. TACAS 2004: 61-76 - 2003
- [c38]Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf:
Comparative Branching-Time Semantics. CONCUR 2003: 482-497 - [c37]Henrik C. Bohnenkamp, Holger Hermanns, Joost-Pieter Katoen, Ric Klaren:
The Modest Modeling Tool and Its Implementation. Computer Performance Evaluation / TOOLS 2003: 116-133 - [c36]Henrik C. Bohnenkamp, Tod Courtney, David Daly, Salem Derisavi, Holger Hermanns, Joost-Pieter Katoen, Ric Klaren, Vinh Vi Lam, William H. Sanders:
On Integrating the MÖBIUS and MODEST Modeling Tools. DSN 2003: 671 - [c35]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle:
ETMCC: Model Checking Performability Properties of Markov Chains. DSN 2003: 673- - [c34]Suzana Andova, Holger Hermanns, Joost-Pieter Katoen:
Discrete-Time Rewards Model-Checked. FORMATS 2003: 88-104 - [c33]David N. Jansen, Holger Hermanns, Joost-Pieter Katoen:
A QoS-Oriented Extension of UML Statecharts. UML 2003: 76-91 - 2002
- [c32]Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort:
Simulation for Continuous-Time Markov Chains. CONCUR 2002: 338-354 - [c31]Boudewijn R. Haverkort, Lucia Cloth, Holger Hermanns, Joost-Pieter Katoen, Christel Baier:
Model Checking Performability Properties. DSN 2002: 103-112 - [c30]David N. Jansen, Holger Hermanns, Joost-Pieter Katoen:
A Probabilistic Extension of UML Statecharts. FTRTFT 2002: 355-374 - [c29]Dino Distefano, Arend Rensink, Joost-Pieter Katoen:
Model Checking Birth and Death. IFIP TCS 2002: 435-447 - [c28]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Automated Performance and Dependability Evaluation Using Model Checking. Performance 2002: 261-289 - 2001
- [c27]Holger Hermanns, Joost-Pieter Katoen:
Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains. CONCUR 2001: 59-81 - [c26]Joost-Pieter Katoen, Marta Z. Kwiatkowska, Gethin Norman, David Parker:
Faster and Symbolic CTMC Model Checking. PAPM-PROBMIV 2001: 23-38 - [c25]Gabriel G. Infante López, Holger Hermanns, Joost-Pieter Katoen:
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains. PAPM-PROBMIV 2001: 57-70 - [c24]Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter Katoen, Ric Klaren:
MoDeST - A Modelling and Description Language for Stochastic Timed Systems. PAPM-PROBMIV 2001: 87-104 - [c23]Theo C. Ruys, Rom Langerak, Joost-Pieter Katoen, Diego Latella, Mieke Massink:
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders. TACAS 2001: 220-235 - 2000
- [c22]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Model Checking Continuous-Time Markov Chains by Transient Analysis. CAV 2000: 358-372 - [c21]Joost-Pieter Katoen, Pedro R. D'Argenio:
General Distributions in Process Algebra. European Educational Forum: School on Formal Methods and Performance Analysis 2000: 375-430 - [c20]Dino Distefano, Joost-Pieter Katoen, Arend Rensink:
On a Temporal Logic for Object-Based Systems. FMOODS 2000: 305-325 - [c19]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
On the Logical Characterisation of Performability Properties. ICALP 2000: 780-792 - [c18]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle:
Towards Model Checking Stochastic Process Algebra. IFM 2000: 420-439 - [c17]Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
On the Use of Model Checking Techniques for Dependability Evaluation. SRDS 2000: 228-237 - [c16]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle:
A Markov Chain Model Checker. TACAS 2000: 347-362 - 1999
- [c15]Christel Baier, Joost-Pieter Katoen, Holger Hermanns:
Approximate Symbolic Model Checking of Continuous-Time Markov Chains. CONCUR 1999: 146-161 - [c14]Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinksma:
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality. RTSS 1999: 104-114 - 1998
- [c13]Howard Bowman, Joost-Pieter Katoen:
A True Concurrency Semantics for ET-LOTOS. ACSD 1998: 228-238 - [c12]Joost-Pieter Katoen, Lennard Lambert:
Pomsets for MSC. FBT 1998: 197-207 - [c11]Christel Baier, Joost-Pieter Katoen, Diego Latella:
Metric Semantics for True Concurrent Real Time. ICALP 1998: 568-579 - [c10]Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinksma:
An algebraic approach to the specification of stochastic systems. PROCOMET 1998: 126-147 - [c9]Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter Katoen:
On Generative Parallel Composition. PROBMIV 1998: 30-54 - 1997
- [c8]Rom Langerak, Ed Brinksma, Joost-Pieter Katoen:
Causal Ambiguity and Partial Orders in Event Structures. CONCUR 1997: 317-331 - [c7]Pedro R. D'Argenio, Joost-Pieter Katoen, Theo C. Ruys, Jan Tretmans:
The Bounded Retransmission Protocol Must Be on Time! TACAS 1997: 416-431 - 1996
- [c6]Albert Nymeyer, Joost-Pieter Katoen, Ymte Westra, Henk Alblas:
Code Generation = A* + BURS. CC 1996: 160-176 - [c5]Joost-Pieter Katoen, Rom Langerak, Diego Latella, Ed Brinksma:
On Specifying Real-Time Systems in a Causality-Based Setting. FTRTFT 1996: 385-404 - 1995
- [c4]Joost-Pieter Katoen:
Causal Behaviours and Nets. Application and Theory of Petri Nets 1995: 258-277 - 1993
- [c3]Joost-Pieter Katoen, Rom Langerak, Diego Latella:
Modeling Systems by Probabilistic Process Algebra: an Event Structures Approach. FORTE 1993: 253-268 - [c2]Joost-Pieter Katoen:
A Semi-Markov Model of a Home Network Access Protocol. MASCOTS 1993: 293-298 - 1991
- [c1]Joost-Pieter Katoen, Berry Schoenmakers:
A Parallel program for the recognition of P-Invariant segments. Algorithms and Parallel VLSI Architectures 1991: 79-84
Parts in Books or Collections
- 2019
- [p4]Christel Baier, Holger Hermanns, Joost-Pieter Katoen:
The 10, 000 Facets of MDP Model Checking. Computing and Software Science 2019: 420-451 - 2017
- [p3]Radu Calinescu, Marco Autili, Javier Cámara, Antinisca Di Marco, Simos Gerasimou, Paola Inverardi, Alexander Perucci, Nils Jansen, Joost-Pieter Katoen, Marta Z. Kwiatkowska, Ole J. Mengshoel, Romina Spalazzese, Massimo Tivoli:
Synthesis and Verification of Self-aware Computing Systems. Self-Aware Computing Systems 2017: 337-373 - 2014
- [p2]Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll:
Formal validation methods in model-based spacecraft systems engineering. Modeling and Simulation-Based Systems Engineering Handbook 2014: 339-376 - 2013
- [p1]Joost-Pieter Katoen:
Model Checking Meets Probability: A Gentle Introduction. Engineering Dependable Software Systems 2013: 177-205
Editorship
- 2023
- [e12]Marsha Chechik, Joost-Pieter Katoen, Martin Leucker:
Formal Methods - 25th International Symposium, FM 2023, Lübeck, Germany, March 6-10, 2023, Proceedings. Lecture Notes in Computer Science 14000, Springer 2023, ISBN 978-3-031-27480-0 [contents] - 2022
- [e11]Helen Bolke-Hermanns, Joost-Pieter Katoen, Klaus Indermark, Stefan Kowalewski, Thomas Noll, Wolfgang Thomas:
50 Jahre Studiengang Informatik an der RWTH. RWTH Aachen, Fachgruppe Informatik in der Fakultät für Mathematik, Informatik und Naturwissenschaften, Germany 2022 - 2019
- [e10]Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen:
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. LIPIcs 138, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-117-7 [contents] - [e9]Nan Guan, Joost-Pieter Katoen, Jun Sun:
Dependable Software Engineering. Theories, Tools, and Applications - 5th International Symposium, SETTA 2019, Shanghai, China, November 27-29, 2019, Proceedings. Lecture Notes in Computer Science 11951, Springer 2019, ISBN 978-3-030-35539-5 [contents] - 2017
- [e8]Joost-Pieter Katoen, Rom Langerak, Arend Rensink:
ModelEd, TestEd, TrustEd - Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10500, Springer 2017, ISBN 978-3-319-68269-3 [contents] - 2011
- [e7]Joost-Pieter Katoen, Barbara König:
CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings. Lecture Notes in Computer Science 6901, Springer 2011, ISBN 978-3-642-23216-9 [contents] - 2007
- [e6]Boudewijn R. Haverkort, Joost-Pieter Katoen, Lothar Thiele:
Quantitative Aspects of Embedded Systems, 04.03. - 09.03.2007. Dagstuhl Seminar Proceedings 07101, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2005
- [e5]Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, Alexander Pretschner:
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]. Lecture Notes in Computer Science 3472, Springer 2005, ISBN 3-540-26278-4 [contents] - 2004
- [e4]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen, Markus Siegle:
Validation of Stochastic Systems - A Guide to Current Research. Lecture Notes in Computer Science 2925, Springer 2004, ISBN 3-540-22265-0 [contents] - 2002
- [e3]Joost-Pieter Katoen, Perdita Stevens:
Tools and Algorithms for the Construction and Analysis of Systems, 8th International Conference, TACAS 2002, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002, Proceedings. Lecture Notes in Computer Science 2280, Springer 2002, ISBN 3-540-43419-4 [contents] - 2001
- [e2]Ed Brinksma, Holger Hermanns, Joost-Pieter Katoen:
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. Lecture Notes in Computer Science 2090, Springer 2001, ISBN 3-540-42479-2 [contents] - 1999
- [e1]Joost-Pieter Katoen:
Formal Methods for Real-Time and Probabilistic Systems, 5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999. Proceedings. Lecture Notes in Computer Science 1601, Springer 1999, ISBN 3-540-66010-0 [contents]
Data and Artifacts
- 2024
- [d25]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Artifact supplement for 'An Oracle-Guided Approach to Constrained Controller Synthesis Under Uncertainty'. Version 1. Zenodo, 2024 [all versions]
- [d24]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Artifact supplement for 'An Oracle-Guided Approach to Constrained Controller Synthesis Under Uncertainty'. Version 2. Zenodo, 2024 [all versions] - [d23]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Artifact supplement for 'An Oracle-Guided Approach to Constrained Controller Synthesis Under Uncertainty'. Version 3. Zenodo, 2024 [all versions] - [d22]Lutz Klinkenberg, Christian Blumenthal, Mingshuai Chen, Darion Haase, Joost-Pieter Katoen:
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions Artifact. Version 1. Zenodo, 2024 [all versions] - [d21]Lutz Klinkenberg, Christian Blumenthal, Mingshuai Chen, Darion Haase, Joost-Pieter Katoen:
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions Artifact. Version 2. Zenodo, 2024 [all versions] - 2023
- [d20]Roman Andriushchenko, Alexander Bork, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Artifact supplement for 'Search and Explore: Symbiotic Policy Synthesis in POMDPs'. Version 0.3. Zenodo, 2023 [all versions] - [d19]Roman Andriushchenko, Alexander Bork, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Artifact supplement for 'Search and Explore: Symbiotic Policy Synthesis in POMDPs'. Version 0.4. Zenodo, 2023 [all versions] - [d18]Roman Andriushchenko, Alexander Bork, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Artifact supplement for 'Search and Explore: Symbiotic Policy Synthesis in POMDPs'. Version 0.5. Zenodo, 2023 [all versions] - [d17]Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann, Tobias Winkler:
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains (Artifact). Zenodo, 2023 - [d16]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs - Artifact Evaluation. Zenodo, 2023 - [d15]Tobias Winkler, Joost-Pieter Katoen:
ARTIFACT EVALUATION FOR TACAS '23 SUBMISSION 103: "Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration". Zenodo, 2023 - 2022
- [d14]Thom S. Badings, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Experiments for 'Scenario-Based Verification of Uncertain Parametric MDPs'. Zenodo, 2022 - [d13]Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg, Tobias Winkler:
Prodigy - Artifact Evaluation at CAV 2022. Zenodo, 2022 - [d12]Shahid Khan, Joost-Pieter Katoen, Marc Bouissou:
A Compositional Semantics of Boolean-Logic Driven Markov Processes. Version 0.0. Zenodo, 2022 [all versions] - [d11]Shahid Khan, Joost-Pieter Katoen, Marc Bouissou:
A Compositional Semantics of Boolean-Logic Driven Markov Processes. Version 0.0. Zenodo, 2022 [all versions] - [d10]Shahid Khan, Joost-Pieter Katoen, Marc Bouissou:
A Compositional Semantics of Boolean-Logic Driven Markov Processes. Version 0.0. Zenodo, 2022 [all versions] - [d9]Jip Spel, Sebastian Junges, Joost-Pieter Katoen:
Finding Provably Optimal Markov Chains (Artifact). Zenodo, 2022 - [d8]Jip Spel, Svenja Stein, Joost-Pieter Katoen:
POMDP Controllers With Optimal Budget (Artifact). Zenodo, 2022 - 2021
- [d7]Alexander Bork, Joost-Pieter Katoen, Tim Quatmann:
Artifact for Paper: Under-Approximating Expected Total Rewards in POMDPs. Version 3. Zenodo, 2021 [all versions] - [d6]Alexander Bork, Joost-Pieter Katoen, Tim Quatmann:
Update Package for Artifact for Paper: Under-Approximating Expected Total Rewards in POMDPs. Zenodo, 2021 - [d5]Alexander Bork, Joost-Pieter Katoen, Tim Quatmann:
Artifact for Paper: Under-Approximating Expected Total Rewards in POMDPs. Version 1. Zenodo, 2021 [all versions] - [d4]Alexander Bork, Joost-Pieter Katoen, Tim Quatmann:
Artifact for Paper: Under-Approximating Expected Total Rewards in POMDPs. Version 2. Zenodo, 2021 [all versions] - [d3]Linus Heck, Jip Spel, Sebastian Junges, Joshua Moerman, Joost-Pieter Katoen:
Gradient-Descent for Randomized Controllers under Partial Observability (Artifact). Zenodo, 2021 - 2020
- [d2]Tim Quatmann, Joost-Pieter Katoen:
Multi-objective Optimization of Long-run Average and Total Rewards: Supplemental Material. Version 2. Zenodo, 2020 [all versions] - [d1]Tim Quatmann, Joost-Pieter Katoen:
Multi-objective Optimization of Long-run Average and Total Rewards: Supplemental Material. Version 1. Zenodo, 2020 [all versions]
Informal and Other Publications
- 2024
- [i102]Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann, Tobias Winkler:
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains. CoRR abs/2401.10638 (2024) - [i101]Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano:
Natural Strategic Ability in Stochastic Multi-Agent Systems. CoRR abs/2401.12170 (2024) - [i100]Darion Haase, Joost-Pieter Katoen:
Unknown Biases and Timing Constraints in Timed Automata. CoRR abs/2403.02210 (2024) - [i99]Timm Spork, Christel Baier, Joost-Pieter Katoen, Jakob Piribauer, Tim Quatmann:
A Spectrum of Approximate Probabilistic Bisimulations. CoRR abs/2407.07584 (2024) - [i98]Raphaël Berthon, Joost-Pieter Katoen, Tobias Winkler:
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives. CoRR abs/2408.01212 (2024) - 2023
- [i97]Tobias Winkler, Joost-Pieter Katoen:
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration. CoRR abs/2301.08657 (2023) - [i96]Lutz Klinkenberg, Tobias Winkler, Mingshuai Chen, Joost-Pieter Katoen:
Exact Probabilistic Inference Using Generating Functions. CoRR abs/2302.00513 (2023) - [i95]Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan:
Lower Bounds for Possibly Divergent Probabilistic Programs. CoRR abs/2302.06082 (2023) - [i94]Tobias Winkler, Joost-Pieter Katoen:
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata. CoRR abs/2304.09997 (2023) - [i93]Bahare Salmani, Joost-Pieter Katoen:
Finding an ε-close Variation of Parameters in Bayesian Networks. CoRR abs/2305.10051 (2023) - [i92]Roman Andriushchenko, Alexander Bork, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen, Filip Macák:
Search and Explore: Symbiotic Policy Synthesis in POMDPs. CoRR abs/2305.14149 (2023) - [i91]Lutz Klinkenberg, Christian Blumenthal, Mingshuai Chen, Joost-Pieter Katoen:
Exact Bayesian Inference for Loopy Probabilistic Programs. CoRR abs/2307.07314 (2023) - [i90]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs. CoRR abs/2309.07781 (2023) - [i89]Kevin Batz, Tom Jannik Biskup, Joost-Pieter Katoen, Tobias Winkler:
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs. CoRR abs/2311.06889 (2023) - [i88]Sebastian Junges, Joost-Pieter Katoen, Scott Sanner, Guy Van den Broeck, Bahare Salmani:
Scalable Analysis of Probabilistic Models and Programs (Dagstuhl Seminar 23241). Dagstuhl Reports 13(6): 1-21 (2023) - 2022
- [i87]Alexander Bork, Joost-Pieter Katoen, Tim Quatmann:
Under-Approximating Expected Total Rewards in POMDPs. CoRR abs/2201.08772 (2022) - [i86]Kevin Batz, Ira Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Keßler, Christoph Matheja, Thomas Noll:
Foundations for Entailment Checking in Quantitative Separation Logic (extended version). CoRR abs/2201.11464 (2022) - [i85]Daniel Basgöze, Matthias Volk, Joost-Pieter Katoen, Shahid Khan, Mariëlle Stoelinga:
BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees. CoRR abs/2202.02829 (2022) - [i84]Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler:
Weighted Programming. CoRR abs/2202.07577 (2022) - [i83]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen:
Inductive Synthesis of Finite-State Controllers for POMDPs. CoRR abs/2203.10803 (2022) - [i82]Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg, Tobias Winkler:
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions. CoRR abs/2205.01449 (2022) - [i81]Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants. CoRR abs/2205.06152 (2022) - [i80]Ira Fesefeldt, Joost-Pieter Katoen, Thomas Noll:
Towards Concurrent Quantitative Separation Logic. CoRR abs/2207.02822 (2022) - [i79]Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Parameter Synthesis in Markov Models: A Gentle Survey. CoRR abs/2207.06801 (2022) - [i78]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming. CoRR abs/2209.09703 (2022) - [i77]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht:
A Calculus for Amortized Expected Runtimes. CoRR abs/2211.12923 (2022) - 2021
- [i76]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Probabilistic Data with Continuous Distributions. CoRR abs/2101.12289 (2021) - [i75]Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen:
Inductive Synthesis for Probabilistic Programs Reaches New Horizons. CoRR abs/2101.12683 (2021) - [i74]Milan Ceska, Christian Dehnert, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Model Repair Revamped: On the Automated Synthesis of Markov Chains. CoRR abs/2105.13411 (2021) - [i73]Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
Latticed k-Induction with an Application to Probabilistic Programs. CoRR abs/2105.14100 (2021) - [i72]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming. CoRR abs/2105.14311 (2021) - [i71]Bahare Salmani, Joost-Pieter Katoen:
Fine-Tuning the Odds in Bayesian Networks. CoRR abs/2105.14371 (2021) - [i70]Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Convex Optimization for Parameter Synthesis in MDPs. CoRR abs/2107.00108 (2021) - [i69]Emma Ahrens, Marius Bozga, Radu Iosif, Joost-Pieter Katoen:
Local Reasoning about Parameterized Reconfigurable Distributed Systems. CoRR abs/2107.05253 (2021) - [i68]Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
The Probabilistic Termination Tool Amber. CoRR abs/2107.13072 (2021) - [i67]Tobias Winkler, Christina Gehnen, Joost-Pieter Katoen:
Model Checking Temporal Properties of Recursive Probabilistic Programs. CoRR abs/2111.03501 (2021) - [i66]Linus Heck, Jip Spel, Sebastian Junges, Joshua Moerman, Joost-Pieter Katoen:
Gradient-Descent for Randomized Controllers under Partial Observability. CoRR abs/2111.04407 (2021) - [i65]Thom S. Badings, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Scenario-Based Verification of Uncertain Parametric MDPs. CoRR abs/2112.13020 (2021) - 2020
- [i64]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. CoRR abs/2001.06358 (2020) - [i63]Christian Hensel, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann, Matthias Volk:
The Probabilistic Model Checker Storm. CoRR abs/2002.07080 (2020) - [i62]Lukas Westhofen, Philipp Berger, Joost-Pieter Katoen:
Benchmarking Software Model Checkers on Automotive Code. CoRR abs/2003.11689 (2020) - [i61]Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
PrIC3: Property Directed Reachability for MDPs. CoRR abs/2004.14835 (2020) - [i60]Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler:
Stochastic Games with Lexicographic Reachability-Safety Objectives. CoRR abs/2005.04018 (2020) - [i59]Marcin Szymczak, Joost-Pieter Katoen:
Weakest Preexpectation Semantics for Bayesian Inference. CoRR abs/2005.09013 (2020) - [i58]Alexander Bork, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann:
Verification of indefinite-horizon POMDPs. CoRR abs/2007.00102 (2020) - [i57]Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler:
Generating Functions for Probabilistic Programs. CoRR abs/2007.06327 (2020) - [i56]Bahare Salmani, Joost-Pieter Katoen:
Bayesian Inference by Symbolic Model Checking. CoRR abs/2007.15071 (2020) - [i55]Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler:
The Complexity of Reachability in Parametric Markov Decision Processes. CoRR abs/2009.13128 (2020) - [i54]Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
Automated Termination Analysis of Polynomial Probabilistic Programs. CoRR abs/2010.03444 (2020) - [i53]Tim Quatmann, Joost-Pieter Katoen:
Multi-objective Optimization of Long-run Average and Total Rewards. CoRR abs/2010.13566 (2020) - [i52]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively Complete Verification of Probabilistic Programs. CoRR abs/2010.14548 (2020) - [i51]Tobias Winkler, Johannes Lehmann, Joost-Pieter Katoen:
Out of Control: Reducing Probabilistic Models by Control-State Elimination. CoRR abs/2011.00983 (2020) - 2019
- [i50]Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Kantorovich Continuity of Probabilistic Programs. CoRR abs/1901.06540 (2019) - [i49]Milan Ceska, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Shepherding Hordes of Markov Chains. CoRR abs/1902.05727 (2019) - [i48]Majdi Ghadhab, Sebastian Junges, Joost-Pieter Katoen, Matthias Kuntz, Matthias Volk:
Safety Analysis for Vehicle Guidance Systems with Dynamic Fault Trees. CoRR abs/1903.05361 (2019) - [i47]Sebastian Junges, Erika Ábrahám, Christian Hensel, Nils Jansen, Joost-Pieter Katoen, Tim Quatmann, Matthias Volk:
Parameter Synthesis for Markov Models. CoRR abs/1903.07993 (2019) - [i46]Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen:
Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification. CoRR abs/1904.01117 (2019) - [i45]Tobias Winkler, Sebastian Junges, Guillermo A. Pérez, Joost-Pieter Katoen:
On the Complexity of Reachability in Parametric Markov Decision Processes. CoRR abs/1904.01503 (2019) - [i44]Milan Ceska, Christian Hensel, Sebastian Junges, Joost-Pieter Katoen:
Counterexample-Driven Synthesis for Probabilistic Program Sketches. CoRR abs/1904.12371 (2019) - [i43]Philipp Berger, Johanna Nellen, Joost-Pieter Katoen, Erika Ábrahám, Md Tawhid Bin Waez, Thomas Rambow:
Multiple Analyses, Requirements Once: simplifying testing & verification in automotive model-based development. CoRR abs/1906.07083 (2019) - [i42]Jip Spel, Sebastian Junges, Joost-Pieter Katoen:
Are Parametric Markov Chains Monotonic? CoRR abs/1907.08491 (2019) - [i41]Florent Delgrange, Joost-Pieter Katoen, Tim Quatmann, Mickael Randour:
Simple Strategies in Multi-Objective MDPs (Technical Report). CoRR abs/1910.11024 (2019) - [i40]Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
Scenario-Based Verification of Uncertain MDPs. CoRR abs/1912.11223 (2019) - 2018
- [i39]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times. CoRR abs/1802.10433 (2018) - [i38]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll:
Quantitative Separation Logic. CoRR abs/1802.10467 (2018) - [i37]Sebastian Junges, Joost-Pieter Katoen, Mariëlle Stoelinga, Matthias Volk:
One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs. CoRR abs/1803.05376 (2018) - [i36]Tim Quatmann, Joost-Pieter Katoen:
Sound Value Iteration. CoRR abs/1804.05001 (2018) - [i35]Sebastian Arming, Ezio Bartocci, Krishnendu Chatterjee, Joost-Pieter Katoen, Ana Sokolova:
Parameter-Independent Strategies for pMDPs via POMDPs. CoRR abs/1806.05126 (2018) - [i34]Mohamadreza Ahmadi, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu:
The Partially Observable Games We Play for Cyber Deception. CoRR abs/1810.00092 (2018) - [i33]Nils Jansen, Joost-Pieter Katoen, Pushmeet Kohli, Jan Kretínský:
Machine Learning and Model Checking Join Forces (Dagstuhl Seminar 18121). Dagstuhl Reports 8(3): 74-93 (2018) - 2017
- [i32]Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, Hao Wu:
Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation. CoRR abs/1701.06104 (2017) - [i31]Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ivan Papusha, Hasan A. Poonawala, Ufuk Topcu:
Sequential Convex Programming for the Efficient Verification of Parametric MDPs. CoRR abs/1702.00063 (2017) - [i30]Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen, Matthias Volk:
A storm is Coming: A Modern Probabilistic Model Checker. CoRR abs/1702.04311 (2017) - [i29]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations. CoRR abs/1703.07682 (2017) - [i28]Tim Quatmann, Sebastian Junges, Joost-Pieter Katoen:
Markov Automata with Multiple Objectives. CoRR abs/1704.06648 (2017) - [i27]Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, Bernd Becker:
Motion Planning under Partial Observability using Game-Based Abstraction. CoRR abs/1708.04236 (2017) - [i26]Sebastian Junges, Nils Jansen, Ralf Wimmer, Tim Quatmann, Leonore Winterer, Joost-Pieter Katoen, Bernd Becker:
Permissive Finite-State Controllers of POMDPs using Parameter Synthesis. CoRR abs/1710.10294 (2017) - [i25]Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A New Proof Rule for Almost-Sure Termination. CoRR abs/1711.03588 (2017) - 2016
- [i24]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. CoRR abs/1601.01001 (2016) - [i23]Tim Quatmann, Christian Dehnert, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen:
Parameter Synthesis for Markov Models: Faster Than Ever. CoRR abs/1602.05113 (2016) - [i22]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. CoRR abs/1603.02922 (2016) - [i21]Matthias Volk, Sebastian Junges, Joost-Pieter Katoen:
Advancing Dynamic Fault Tree Analysis. CoRR abs/1604.07474 (2016) - [i20]Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen:
Bounded Model Checking for Probabilistic Programs. CoRR abs/1605.04477 (2016) - [i19]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Inferring Covariances for Probabilistic Programs. CoRR abs/1606.08280 (2016) - [i18]Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, Hao Wu:
Proving Linearizability via Branching Bisimulation. CoRR abs/1609.07546 (2016) - [i17]Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen, Matthias Volk:
The Probabilistic Model Checker Storm (Extended Abstract). CoRR abs/1610.08713 (2016) - [i16]Sebastian Junges, Nils Jansen, Joost-Pieter Katoen, Ufuk Topcu:
Probabilistic Model Checking for Complex Cognitive Tasks - A case study in human-robot interaction. CoRR abs/1610.09409 (2016) - 2015
- [i15]Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver, Federico Olmedo:
Conditioning in Probabilistic Programming. CoRR abs/1504.00198 (2015) - [i14]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
On the Hardness of Almost-Sure Termination. CoRR abs/1506.01930 (2015) - [i13]Sebastian Junges, Nils Jansen, Christian Dehnert, Ufuk Topcu, Joost-Pieter Katoen:
Safety-Constrained Reinforcement Learning for MDPs. CoRR abs/1510.05880 (2015) - [i12]Gilles Barthe, Andrew D. Gordon, Joost-Pieter Katoen, Annabelle McIver:
Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181). Dagstuhl Reports 5(4): 123-141 (2015) - 2014
- [i11]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-Reachability in Probabilistic Multi-Counter Automata. CoRR abs/1401.6840 (2014) - [i10]Joost-Pieter Katoen, Lei Song, Lijun Zhang:
Probably Safe or Live. CoRR abs/1401.7171 (2014) - [i9]Souymodip Chakraborty, Joost-Pieter Katoen:
Parametric LTL on Markov Chains. CoRR abs/1406.6683 (2014) - [i8]Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, Alessandro Abate:
Quantitative model-checking of controlled discrete-time Markov processes. CoRR abs/1407.5449 (2014) - [i7]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard. CoRR abs/1410.7225 (2014) - 2013
- [i6]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen, Mark Timmer:
Modelling, Reduction and Analysis of Markov Automata (extended version). CoRR abs/1305.7050 (2013) - [i5]Nils Jansen, Florian Corzilius, Matthias Volk, Ralf Wimmer, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker:
Accelerating Parametric Probabilistic Verification. CoRR abs/1312.3979 (2013) - [i4]Albert Cohen, Alastair F. Donaldson, Marieke Huisman, Joost-Pieter Katoen:
Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142). Dagstuhl Reports 3(4): 17-33 (2013) - 2012
- [i3]Nils Jansen, Erika Ábrahám, Maik Scheffler, Matthias Volk, Andreas Vorpahl, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker:
The COMICS Tool - Computing Minimal Counterexamples for Discrete-time Markov Chains. CoRR abs/1206.0603 (2012) - 2007
- [i2]Boudewijn R. Haverkort, Joost-Pieter Katoen, Lothar Thiele:
07101 Executive Summary -- Quantitative Aspects of Embedded Systems. Quantitative Aspects of Embedded Systems 2007 - [i1]Boudewijn R. Haverkort, Joost-Pieter Katoen, Lothar Thiele:
07101 Abstracts Collection -- Quantitative Aspects of Embedded Systems. Quantitative Aspects of Embedded Systems 2007
Coauthor Index
Christian Hensel
aka: Christian Dehnert
aka: Christian Dehnert
[j54] [j49] [j47] [j41] [j39] [j36] [j28] [j27] [j23] [j22] [j21] [j18] [j17] [j16] [j15] [j12] [c134] [c127] [c86] [c78] [c75] [c54] [c47] [c46] [c41] [c40] [c39] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [c28] [c27] [c25] [c24] [c22] [c19] [c18] [c17] [c16] [c15] [c9] [p4] [e4] [e2] [i6]
[j104] [j84] [j83] [j77] [j65] [j58] [j51] [j50] [c248] [c211] [c207] [c199] [c198] [c195] [c187] [c185] [c181] [c176] [c172] [c171] [c170] [c169] [c163] [c158] [c155] [c154] [c152] [c149] [c147] [c145] [c136] [c135] [c128] [c123] [c120] [c115] [c112] [c110] [c91] [p3] [d14] [i79] [i74] [i70] [i65] [i49] [i47] [i40] [i34] [i33] [i31] [i27] [i26] [i23] [i20] [i16] [i15] [i13] [i5] [i3]
[j104] [j92] [j85] [j84] [j83] [j82] [j81] [j77] [j76] [j75] [j69] [j66] [j64] [c253] [c249] [c248] [c239] [c238] [c234] [c225] [c224] [c222] [c220] [c211] [c208] [c207] [c206] [c205] [c199] [c198] [c196] [c195] [c187] [c185] [c182] [c181] [c178] [c177] [c176] [c174] [c172] [c171] [c170] [c168] [c163] [c161] [c159] [c158] [c154] [c148] [d25] [d24] [d23] [d20] [d19] [d18] [d14] [d9] [d3] [i92] [i88] [i83] [i81] [i79] [i75] [i74] [i70] [i66] [i65] [i63] [i61] [i58] [i55] [i49] [i48] [i47] [i45] [i44] [i42] [i40] [i37] [i34] [i31] [i30] [i28] [i27] [i26] [i23] [i21] [i17] [i16] [i13]
[j97] [j96] [j95] [j89] [j88] [j80] [j79] [j78] [j74] [j72] [j70] [j68] [j67] [j65] [c249] [c235] [c220] [c218] [c216] [c190] [c183] [c175] [c169] [c167] [c164] [c162] [c155] [c150] [c147] [d16] [i95] [i90] [i84] [i81] [i77] [i76] [i73] [i64] [i61] [i57] [i52] [i50] [i46] [i39] [i38] [i29] [i25] [i24] [i22] [i20] [i19] [i15] [i14] [i7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
