Undecidability Results for Bisimilarity on Prefix Rewrite Systems

Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by S

• Type: Conference
• Year: 2006
• Where: FOSSACS
• Authors: Petr Jancar, Jirí Srba
• Keywords: FOSSACS 2006, Prefix Rewrite Rules, Pushdown Processes, Software Engineering, Type -1 Systems