Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    New Approaches for Almost-Sure Termination of Probabilistic Programs

    We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure t...

    Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee in Programming Languages and Systems (2018)

  2. No Access

    Chapter and Conference Paper

    Branching Bisimilarity Checking for PRS

    Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any othe...

    Qiang Yin, Yuxi Fu, Chaodong He, Mingzhang Huang in Automata, Languages, and Programming (2014)