Personal Info about Hongfei Fu

E-Mail:

hongfeifu(at)cs.rwth-aachen.de

Phone:

+49-241/80-21210

Fax:

+49-241/80-22217

Postal Address:

Hongfei Fu

Lehrstuhl für Informatik II

RWTH Aachen

D-52056 Aachen

Germany

Visiting Address:

Room 4207

(Building E1)

Ahornstraße 55

D-52074 Aachen

 

 


Publications

2014
LinkHongfei Fu. Verifying Probabilistic Systems: New Algorithms and Complexity Results. Phd Thesis at RWTH Aachen University, 2014.
Hongfei Fu. Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes, Talk at FOSSACS 2014, 2014.
DownloadHongfei Fu. Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes. FoSSaCS, Volume 8412 of LNCS, pages 73–87, Springer, 2014.
2013
LinkHongfei Fu. Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata. Hybrid Systems: Computation and Control (HSCC), pages 323–332, ACM, 2013.
Hongfei Fu. Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata, Conference Talk at HSCC 2013, 2013.
2012
Hongfei Fu. Computing Game Metrics on Markov Decision Processes, Talk at ICALP, Birmingham, 2012.
Hongfei Fu. Computing Game Metrics on Markov Decision Processes, Talk at Oxford University, Oxford, 2012.
Hongfei Fu. Computing Game Metrics on Markov Decision Processes. 39th International Colloquium on Automata, Languages and Programming (ICALP), Volume 7392 of LNCS, pages 227–238, Springer-Verlag, 2012.
2011
Hongfei Fu. Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems, Talk at ROCKS workshop, Herrsching, 2011.
Hongfei Fu. Model Checking EGF on Basic Parallel Processes, Talk at ATVA, 2011.
Hongfei Fu. Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems, Talk at YR-CONCUR, 2011.
Hongfei Fu. Model Checking EGF on Basic Parallel Processes. 9th International Symposium on Automated Technology for Verification and Analysis (ATVA), Volume 6996 of LNCS, pages 120–134, Springer, 2011.
LinkHongfei Fu, Joost-Pieter Katoen. Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Volume 13 of LIPIcs, pages 445–456, Schloss Dagstuhl, 2011.
2009
Hongfei Fu. Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable. 7th Asian Symposium on Programming Languages and Systems (APLAS), Volume 5904 of LNCS, pages 327–342, Springer, 2009.