5 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.LO2013★ 5 cited
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
Roy Mennicke
The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound ,…
cs.DS2010★ 3 cited
Tree structure compression with RePair
Markus Lohrey, Sebastian Maneth, Roy Mennicke
In this work we introduce a new linear time compression algorithm, called "Re-pair for Trees", which compresses ranked ordered trees using linear straight-line context-free tree gr…