Joost-Pieter Katoen
Nacht der Professoren
Joost-Pieter Katoen puts on some music at around 23:00 on Friday June 27. The entry fees are used to support students in third World countries.
Paper accepted at IFIP TCS'14
The paper “Parametric LTL on Markov Chains” by Souymodip Chakraborty and Joost-Pieter Katoen has been accepted at the IFIP TCS conference. The paper shows the undecidability of verifying a Markov chain against a parametric LTL (pLTL) formula, and studies the complexity of model checking several logical fragments of pLTL.
Paper accepted at CONCUR'14
The paper “Tight Game Abstractions of Probabilistic Automata” by Falak Sher and Joost-Pieter Katoen has been accepted at the conference Concurrency Theory. The paper presents game-based abstraction that is based on abstracting distributions (rather than states) and shows that this yields more accurate abstraction than state-based abstractions.
Two papers accepted at CSL-LICS
The papers “Probably Safe or Live” by Katoen, Song and Zhang, and “Zero-Reachability in Probabilistic Multi-Counter Automata” by Brazdil, Kiefer, Kucera, Novotny and Katoen have been accepted at CSL-LICS 2014 in Vienna. The former paper classifies safety and liveness properties in the probabilistic setting while the second paper sets the ground for showing some flaws […]
ACSD 2014 paper accepted
The paper entitled “Layered Reduction for Abstract Probabilistic Automata” by Arpit Sharma and Joost-Pieter Katoen has been accepted for the 14th Int. Conf. on Application of Concurrency on System Design (ACSD) 2014.