Jasper Berendsen Currently I'm a junior researcher (PhD student) with Frits Vaandrager and Jozef Hooman in the group Model Based System Development at the Radboud University Nijmegen Research Interests Development of the tool Fortuna! model checking model checking of priced probabilistic timed automata (PPTAs) real-time probabilistic model checking compositional reasoning

Publications

• J. Berendsen, D. N. Jansen, J. Schmaltz, and F.W. Vaandrager. The Axiomatization of Overriding and Update. To appear in Journal of Applied Logic.
• J. Berendsen, Taolue Chen, and D. N. Jansen. Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. In J. Chen and S. B. Cooper, editors. Proceedings of The 6th Annual Conference on Theory and Applications of Models of Computation TAMC'09, Changsha, China, May 18-22, 2009. LNCS 5532, Springer, 2009.
• J. Berendsen, B. Gebremichael, F.W. Vaandrager, and Miaomiao Zhang. Formal Specification and Analysis of Zeroconf using Uppaal. To appear in ACM TECS.
• J. Berendsen and F.W. Vaandrager. Compositional Abstraction in Real-Time Model Checking. In F. Cassez and C. Jard, editors. Proceedings of FORMATS'08, Saint-Malo, France, September 15-17, 2008. LNCS 5215, Springer, 2008.
• J. Berendsen, D. N. Jansen, and J.-P. Katoen. Probably on Time and within Budget - On Reachability in Priced Probabilistic Timed Automata. In Quantitative Evaluation of Systems (QEST). IEEE CS Press, 2006.
• J. Berendsen, D. N. Jansen, and J.-P. Katoen. Probably on Time and within Budget - On Reachability in Priced Probabilistic Timed Automata. Technical report TR-CTIT-06-26, Centre for Telematics and Information Technology, University of Twente, Enschede. ISSN 1381-3625 July 2006.
• J. Berendsen. Reachability in Weighted Probabilistic Timed Automata. Master's thesis, University of Twente, December 2005. Supervisors: Joost-Pieter Katoen and David N. Jansen. Thesis committee: Joost-Pieter Katoen, David N. Jansen, and Rom Langerak.