Fast equivalence-checking for normed context-free processes

Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving the previously known complexity O(n8 polylog(n)). It also improves the previously known complexity O(n6 polylog(n)) of the equality problem for simple grammars. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.1

• Type: Journal
• Year: 2010
• Where: FSTTCS
• Authors: Wojciech Czerwinski, Slawomir Lasota
• Keywords: Bisimulation Equivalence, Context-free Grammar, Digital Object Identifier, FSTTCS 2010, Software Engineering