Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Joost-Pieter Katoen
2010 – today
- 2013
[j51]Ernst Moritz Hahn, Arnd Hartmanns, Holger Hermanns, Joost-Pieter Katoen: A compositional modelling and analysis framework for stochastic hybrid systems. Formal Methods in System Design 43(2): 191-232 (2013)- [c130]Christian Eisentraut, Holger Hermanns, Joost-Pieter Katoen, Lijun Zhang: A Semantics for Every GSPN. Petri Nets 2013: 90-109
- [c129]Joost-Pieter Katoen: Concurrency Meets Probability: Theory and Practice - (Abstract). CONCUR 2013: 44-45
- [c128]Joost-Pieter Katoen, Thomas Noll, Hao Wu, Thomas Santen, Dirk Seifert: Model-based energy optimization of automotive control systems. DATE 2013: 761-766
- [c127]Joost-Pieter Katoen, Doron Peled: Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems. ESOP 2013: 411-430
- [c126]Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, Alessandro Abate: Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems. HSCC 2013: 293-302
- [c125]Ralf Wimmer, Nils Jansen, Andreas Vorpahl, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker: High-Level Counterexamples for Probabilistic Automata. QEST 2013: 39-54
- [c124]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen, Mark Timmer: Modelling, Reduction and Analysis of Markov Automata. QEST 2013: 55-71
- [c123]Friedrich Gretz, Joost-Pieter Katoen, Annabelle McIver: Prinsys - On a Quest for Probabilistic Loop Invariants. QEST 2013: 193-208
- [c122]Christian Dehnert, Joost-Pieter Katoen, David Parker: SMT-Based Bisimulation Minimisation of Markov Models. VMCAI 2013: 28-47
- [i4]Ralf Wimmer, Nils Jansen, Andreas Vorpahl, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker: High-level Counterexamples for Probabilistic Automata. CoRR abs/1305.5055 (2013)
- [i3]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)
- [i2]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
- [j50]Mani Swaminathan, Joost-Pieter Katoen, Ernst-Rüdiger Olderog: Layered reasoning for randomized distributed algorithms. Formal Asp. Comput. 24(4-6): 477-496 (2012)
- [j49]Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf: Three-valued abstraction for probabilistic systems. J. Log. Algebr. Program. 81(4): 356-389 (2012)
- [j48]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)
- [c121]
- [c120]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
- [c119]Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga: Efficient Modelling and Generation of Markov Automata. CONCUR 2012: 364-379
- [c118]Bart D. Theelen, Joost-Pieter Katoen, Hao Wu: Model checking of Scenario-Aware Dataflow with CADP. DATE 2012: 653-658
- [c117]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
- [c116]Alessandro D'Innocenzo, Alessandro Abate, Joost-Pieter Katoen: Robust PCTL model checking. HSCC 2012: 275-286
- [c115]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
- [c114]Falak Sher, Joost-Pieter Katoen: Compositional Abstraction Techniques for Probabilistic Automata. IFIP TCS 2012: 325-341
- [c113]Joost-Pieter Katoen, Kim Guldstrand Larsen: Quantitative Modelling and Analysis. ISoLA (2) 2012: 290-292
- [c112]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
- [c111]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
- [c110]Friedrich Gretz, Joost-Pieter Katoen, Annabelle McIver: Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language. QEST 2012: 168-177
- [c109]Ralf Wimmer, Nils Jansen, Erika Ábrahám, Bernd Becker, Joost-Pieter Katoen: Minimal Critical Subsystems for Discrete-Time Markov Models. TACAS 2012: 299-314
- [i1]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)
- 2011
- [j47]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)
- [j46]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre: Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. Logical Methods in Computer Science 7(1) (2011)
- [j45]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. Eval. 68(2): 90-104 (2011)
- [j44]Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen: Time-bounded reachability in tree-structured QBDs by abstraction. Perform. Eval. 68(2): 105-125 (2011)
- [c108]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
- [c107]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
- [c106]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre: Reachability probabilities in Markovian Timed Automata. CDC-ECE 2011: 7075-7080
- [c105]Arpit Sharma, Joost-Pieter Katoen: Weighted Lumpability on Markov Chains. Ershov Memorial Conference 2011: 322-339
- [c104]
- [c103]
- [c102]Hongfei Fu, Joost-Pieter Katoen: Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. FSTTCS 2011: 445-456
- [c101]Alessandro Abate, Joost-Pieter Katoen, Alexandru Mereacre: Quantitative automata model checking of autonomous stochastic hybrid systems. HSCC 2011: 83-92
- [c100]Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll: A Local Greibach Normal Form for Hyperedge Replacement Grammars. LATA 2011: 323-335
- [c99]Haidi Yue, Henrik C. Bohnenkamp, Malte Kampschulte, Joost-Pieter Katoen: Analysing and Improving Energy Efficiency of Distributed Slotted Aloha. NEW2AN 2011: 197-208
- [c98]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre: Observing Continuous-Time MDPs by 1-Clock Timed Automata. RP 2011: 2-25
- [c97]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
- [c96]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
- [e7]Joost-Pieter Katoen, Barbara König (Eds.): 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
- 2010
- [j43]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: Performance evaluation and model checking join forces. Commun. ACM 53(9): 76-85 (2010)
- [j42]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: SMA - The Smyle Modeling Approach. Computing and Informatics 29(1): 45-72 (2010)
- [j41]Alessandro Abate, Joost-Pieter Katoen, John Lygeros, Maria Prandini: Approximate Model Checking of Stochastic Hybrid Systems. Eur. J. Control 16(6): 624-641 (2010)
- [j40]Christel Baier, Lucia Cloth, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: Performability assessment by model checking of Markov reward models. Formal Methods in System Design 36(1): 1-36 (2010)
- [j39]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. Industrial Informatics 6(3): 276-286 (2010)
- [j38]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: Learning Communicating Automata from MSCs. IEEE Trans. Software Eng. 36(3): 390-408 (2010)
- [c95]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
- [c94]Haidi Yue, Joost-Pieter Katoen: Leader Election in Anonymous Radio Networks: Model Checking Energy Consumption. ASMTA 2010: 247-261
- [c93]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, David R. Piegdon: libalf: The Automata Learning Framework. CAV 2010: 360-364
- [c92]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
- [c91]Falko Dulat, Joost-Pieter Katoen, Viet Yen Nguyen: Model Checking Markov Chains Using Krylov Subspace Methods: An Experience Report. EPEW 2010: 115-130
- [c90]Boudewijn R. Haverkort, Joost-Pieter Katoen, Kim G. Larsen: Quantitative Verification in Practice. ISoLA (2) 2010: 127
- [c89]Haidi Yue, Henrik C. Bohnenkamp, Joost-Pieter Katoen: Analyzing Energy Consumption in a Gossiping MAC Protocol. MMB/DFT 2010: 107-119
- [c88]Erika Ábrahám, Nils Jansen, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker: DTMC Model Checking by SCC Reduction. QEST 2010: 37-46
- [c87]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
- [c86]
2000 – 2009
- 2009
- [j37]Tingting Han, Joost-Pieter Katoen, Berteun Damman: Counterexample Generation in Probabilistic Model Checking. IEEE Trans. Software Eng. 35(2): 241-257 (2009)
- [c85]Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre: LTL Model Checking of Time-Inhomogeneous Markov Chains. ATVA 2009: 104-119
- [c84]Marijn R. Jongerden, Boudewijn R. Haverkort, Henrik C. Bohnenkamp, Joost-Pieter Katoen: Maximizing system lifetime by battery scheduling. DSN 2009: 63-72
- [c83]Holger Hermanns, Joost-Pieter Katoen: The How and Why of Interactive Markov Chains. FMCO 2009: 311-337
- [c82]Joost-Pieter Katoen, Daniel Klink, Martin R. Neuhäußer: Compositional Abstraction for Stochastic Systems. FORMATS 2009: 195-211
- [c81]Martin R. Neuhäußer, Mariëlle Stoelinga, Joost-Pieter Katoen: Delayed Nondeterminism in Continuous-Time Markov Decision Processes. FOSSACS 2009: 364-379
- [c80]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
- [c79]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
- [c78]Joost-Pieter Katoen, Ivan S. Zapreev: Simulation-Based CTMC Model Checking: An Empirical Evaluation. QEST 2009: 31-40
- [c77]Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen: Time-Bounded Reachability in Tree-Structured QBDs by Abstraction. QEST 2009: 133-142
- [c76]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
- [c75]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
- [c74]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
- [b1]Christel Baier, Joost-Pieter Katoen: Principles of model checking. MIT Press 2008, ISBN 978-0-262-02649-9, pp. I-XVII, 1-975
- [j36]Joost-Pieter Katoen: How to model and analyze gossiping protocols? SIGMETRICS Performance Evaluation Review 36(3): 3-6 (2008)
- [c73]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: Reachability in continuous-time Markov reward decision processes. Logic and Automata 2008: 53-72
- [c72]Manuela L. Bujorianu, Joost-Pieter Katoen: Symmetry reduction for stochastic hybrid systems. CDC 2008: 233-238
- [c71]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR 2008: 162-166
- [c70]Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf: Abstraction for Stochastic Systems by Erlang's Method of Stages. CONCUR 2008: 279-294
- [c69]Joost-Pieter Katoen: Quantitative Evaluation in Embedded System Design: Trends in Modeling and Analysis Techniques. DATE 2008: 86-87
- [c68]Joost-Pieter Katoen, Alexandru Mereacre: Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains. FORMATS 2008: 203-217
- [c67]Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre: Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains. HSCC 2008: 244-258
- [c66]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: SMA - The Smyle Modeling Approach. CEE-SET 2008: 103-117
- [c65]Mani Swaminathan, Martin Fränzle, Joost-Pieter Katoen: The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. IFIP TCS 2008: 537-553
- [c64]Berteun Damman, Tingting Han, Joost-Pieter Katoen: Regular Expressions for PCTL Counterexamples. QEST 2008: 179-188
- [c63]Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre: Approximate Parameter Synthesis for Probabilistic Time-Bounded Reachability. RTSS 2008: 173-182
- [c62]
- [c61]Taolue Chen, Tingting Han, Joost-Pieter Katoen: Time-Abstracting Bisimulation for Probabilistic Timed Automata. TASE 2008: 177-184
- 2007
- [j35]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)
- [c60]Tingting Han, Joost-Pieter Katoen: Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking. ATVA 2007: 331-346
- [c59]Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf: Three-Valued Abstraction for Continuous-Time Markov Chains. CAV 2007: 311-324
- [c58]Martin R. Neuhäußer, Joost-Pieter Katoen: Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes. CONCUR 2007: 412-427
- [c57]Boudewijn R. Haverkort, Joost-Pieter Katoen, Lothar Thiele: 07101 Executive Summary -- Quantitative Aspects of Embedded Systems. Quantitative Aspects of Embedded Systems 2007
- [c56]Boudewijn R. Haverkort, Joost-Pieter Katoen, Lothar Thiele: 07101 Abstracts Collection -- Quantitative Aspects of Embedded Systems. Quantitative Aspects of Embedded Systems 2007
- [c55]
- [c54]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
- [c53]Tingting Han, Joost-Pieter Katoen: Counterexamples in Probabilistic Model Checking. TACAS 2007: 72-86
- [c52]Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, David N. Jansen: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking. TACAS 2007: 87-101
- [c51]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
- [c50]Henrik C. Bohnenkamp, Holger Hermanns, Joost-Pieter Katoen: motor: The modestTool Environment. TACAS 2007: 500-504
- [e6]Boudewijn R. Haverkort, Joost-Pieter Katoen, Lothar Thiele (Eds.): 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
- 2006
- [j34]Rocco De Nicola, Joost-Pieter Katoen, Diego Latella, Mieke Massink: Towards a Logic for Performance and Mobility. Electr. Notes Theor. Comput. Sci. 153(2): 161-175 (2006)
- [j33]Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf: Bisimulation and Simulation Relations for Markov Chains. Electr. Notes Theor. Comput. Sci. 162: 73-78 (2006)
- [j32]Mario Bravetti, Holger Hermanns, Joost-Pieter Katoen: YMCA: - Why Markov Chain Algebra? - . Electr. Notes Theor. Comput. Sci. 162: 107-112 (2006)
- [j31]Peter Buchholz, Joost-Pieter Katoen, Marcel Verhoef: Guest editors' introduction: quantitative analysis of real-time embedded systems. STTT 8(6): 605-606 (2006)
- [j30]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)
- [j29]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)
- [c49]Joost-Pieter Katoen, Ivan S. Zapreev: Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability. QEST 2006: 301-310
- [c48]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
- [j28]Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Verena Wolf: Comparative branching-time semantics for Markov chains. Inf. Comput. 200(2): 149-214 (2005)
- [j27]Pedro R. D'Argenio, Joost-Pieter Katoen: A theory of stochastic systems part I: Stochastic automata. Inf. Comput. 203(1): 1-38 (2005)
- [j26]Pedro R. D'Argenio, Joost-Pieter Katoen: A theory of Stochastic systems. Part II: Process algebra. Inf. Comput. 203(1): 39-74 (2005)
- [j25]Boudewijn R. Haverkort, Joost-Pieter Katoen: Performance and verification. SIGMETRICS Performance Evaluation Review 32(4): 3 (2005)
- [j24]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: Model checking meets performance evaluation. SIGMETRICS Performance Evaluation Review 32(4): 10-15 (2005)
- [j23]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)
- [c47]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
- [c46]Lucia Cloth, Joost-Pieter Katoen, Maneesh Khattri, Reza Pulungan: Model Checking Markov Reward Models with Impulse Rewards. DSN 2005: 722-731
- [c45]Dino Distefano, Joost-Pieter Katoen, Arend Rensink: Safety and Liveness in Concurrent Pointer Programs. FMCO 2005: 280-312
- [c44]Joost-Pieter Katoen, Maneesh Khattri, Ivan S. Zapreev: A Markov Reward Model Checker. QEST 2005: 243-244
- [e5]Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, Alexander Pretschner (Eds.): 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
- 2004
- [j22]Christel Baier, Holger Hermanns, Joost-Pieter Katoen: Probabilistic weak simulation is decidable in polynomial time. Inf. Process. Lett. 89(3): 123-130 (2004)
- [j21]Joost-Pieter Katoen, Perdita Stevens: Guest editors' introduction: Advancements and extensions of verification techniques. STTT 6(2): 99-101 (2004)
- [c43]Joost-Pieter Katoen: Labelled Transition Systems. Model-Based Testing of Reactive Systems 2004: 615-616
- [c42]Mieke Massink, Joost-Pieter Katoen, Diego Latella: Model Checking Dependability Attributes of Wireless Group Communication. DSN 2004: 711-720
- [c41]Dino Distefano, Joost-Pieter Katoen, Arend Rensink: Who is Pointing When to Whom? FSTTCS 2004: 250-262
- [c40]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
- [c39]Joost-Pieter Katoen, Henrik C. Bohnenkamp, Ric Klaren, Holger Hermanns: Embedded Software Analysis with MOTOR. SFM 2004: 268-294
- [c38]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
- [e4]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen, Markus Siegle (Eds.): Validation of Stochastic Systems - A Guide to Current Research. Lecture Notes in Computer Science 2925, Springer 2004, ISBN 3-540-22265-0
- 2003
- [j20]Peter Buchholz, Joost-Pieter Katoen, Peter Kemper, Carsten Tepper: Model-checking large structured Markov chains. J. Log. Algebr. Program. 56(1-2): 69-97 (2003)
- [j19]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle: A tool for model-checking Markov chains. STTT 4(2): 153-172 (2003)
- [j18]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)
- [c37]Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf: Comparative Branching-Time Semantics. CONCUR 2003: 482-497
- [c36]Henrik C. Bohnenkamp, Holger Hermanns, Joost-Pieter Katoen, Ric Klaren: The Modest Modeling Tool and Its Implementation. Computer Performance Evaluation / TOOLS 2003: 116-133
- [c35]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
- [c34]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle: ETMCC: Model Checking Performability Properties of Markov Chains. DSN 2003: 673-
- [c33]Suzana Andova, Holger Hermanns, Joost-Pieter Katoen: Discrete-Time Rewards Model-Checked. FORMATS 2003: 88-104
- [c32]David N. Jansen, Holger Hermanns, Joost-Pieter Katoen: A QoS-Oriented Extension of UML Statecharts. UML 2003: 76-91
- 2002
- [j17]Holger Hermanns, Joost-Pieter Katoen: Guest editors' introduction: Model checking in a nutshell. J. Log. Algebr. Program. 52-53: 1-5 (2002)
- [j16]Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoen: Process algebra for performance evaluation. Theor. Comput. Sci. 274(1-2): 43-87 (2002)
- [j15]Joost-Pieter Katoen: Real-Time and Probabilistic Systems - Foreword. Theor. Comput. Sci. 282(1): 1-3 (2002)
- [c31]Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort: Simulation for Continuous-Time Markov Chains. CONCUR 2002: 338-354
- [c30]Boudewijn R. Haverkort, Lucia Cloth, Holger Hermanns, Joost-Pieter Katoen, Christel Baier: Model Checking Performability Properties. DSN 2002: 103-112
- [c29]David N. Jansen, Holger Hermanns, Joost-Pieter Katoen: A Probabilistic Extension of UML Statecharts. FTRTFT 2002: 355-374
- [c28]Dino Distefano, Arend Rensink, Joost-Pieter Katoen: Model Checking Birth and Death. IFIP TCS 2002: 435-447
- [c27]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: Automated Performance and Dependability Evaluation Using Model Checking. Performance 2002: 261-289
- [e3]Joost-Pieter Katoen, Perdita Stevens (Eds.): 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
- 2001
- [j14]Joost-Pieter Katoen, Christel Baier, Diego Latella: Metric semantics for true concurrent real time. Theor. Comput. Sci. 254(1-2): 501-542 (2001)
- [c26]Holger Hermanns, Joost-Pieter Katoen: Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains. CONCUR 2001: 59-81
- [c25]Joost-Pieter Katoen, Marta Z. Kwiatkowska, Gethin Norman, David Parker: Faster and Symbolic CTMC Model Checking. PAPM-PROBMIV 2001: 23-38
- [c24]Gabriel G. Infante López, Holger Hermanns, Joost-Pieter Katoen: Beyond Memoryless Distributions: Model Checking Semi-Markov Chains. PAPM-PROBMIV 2001: 57-70
- [c23]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
- [c22]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
- [e2]Ed Brinksma, Holger Hermanns, Joost-Pieter Katoen (Eds.): 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
- 2000
- [j13]Holger Hermanns, Joost-Pieter Katoen: Automated compositional Markov chain generation for a plain-old telephone system. Sci. Comput. Program. 36(1): 97-127 (2000)
- [j12]Joost-Pieter Katoen, Albert Nymeyer: Pattern-matching algorithms based on term rewrite systems. Theor. Comput. Sci. 238(1-2): 439-464 (2000)
- [c21]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: Model Checking Continuous-Time Markov Chains by Transient Analysis. CAV 2000: 358-372
- [c20]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
- [c19]Dino Distefano, Joost-Pieter Katoen, Arend Rensink: On a Temporal Logic for Object-Based Systems. FMOODS 2000: 285-304
- [c18]Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: On the Logical Characterisation of Performability Properties. ICALP 2000: 780-792
- [c17]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle: Towards Model Checking Stochastic Process Algebra. IFM 2000: 420-439
- [c16]Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen: On the Use of Model Checking Techniques for Dependability Evaluation. SRDS 2000: 228-237
- [c15]Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle: A Markov Chain Model Checker. TACAS 2000: 347-362
1990 – 1999
- 1999
- [j11]Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter Katoen: On Generative Parallel Composition. Electr. Notes Theor. Comput. Sci. 22: 30-54 (1999)
- [c14]Christel Baier, Joost-Pieter Katoen, Holger Hermanns: Approximate Symbolic Model Checking of Continuous-Time Markov Chains. CONCUR 1999: 146-161
- [c13]Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinksma: Specification and Analysis of Soft Real-Time Systems: Quantity and Quality. RTSS 1999: 104-114
- [e1]Joost-Pieter Katoen (Ed.): 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
- 1998
- [j10]Ed Brinksma, Joost-Pieter Katoen, Rom Langerak, Diego Latella: Partial Order Models for Quantitative Extensions of LOTOS. Computer 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 Asp. 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 in System Design 12(2): 189-216 (1998)
- [c12]
- [c11]
- [c10]Christel Baier, Joost-Pieter Katoen, Diego Latella: Metric Semantics for True Concurrent Real Time. ICALP 1998: 568-579
- [c9]Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinksma: An algebraic approach to the specification of stochastic systems. PROCOMET 1998: 126-147
- 1997
- [j7]Albert Nymeyer, Joost-Pieter Katoen: Code Generation Based on Formal BURS Therory and Heuristic Search. Acta Inf. 34(8): 597-635 (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
- [j6]Jacob Brunekreef, Joost-Pieter Katoen, Ron Koymans, Sjouke Mauw: Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks. Distributed Computing 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)
- [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
- [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. Computer Networks and ISDN Systems 27(8): 1263-1285 (1995)
- [c4]
- 1993
- [j2]Joost-Pieter Katoen, Martin Rem: Recognizing k-Rotated Segments. International Journal of High Speed Computing 5(2): 293-305 (1993)
- [c3]Joost-Pieter Katoen, Rom Langerak, Diego Latella: Modeling Systems by Probabilistic Process Algebra: an Event Structures Approach. FORTE 1993: 253-268
- [c2]
- 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
1980 – 1989
- 1989
- [j1]C. Hemerik, Joost-Pieter Katoen: Bottom-Up Tree Acceptors. Sci. Comput. Program. 13(1): 51-72 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:10 CEST by the dblp team