activity
20102021
most citedBisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)

31 citations · 56 across the 19 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.LO2017★ 4 cited

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata

Vojtěch Forejt, Petr Jančar, Stefan Kiefer +1

We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branchin…