Behavioural Equivalences on Finite-State Systems are PTIME-hard

The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e., language inclusion) is ptime-hard, even for finite acyclic labelled transition systems. This reproves and substantially extends the result of Balc

• Type: Journal
• Year: 2005
• Where: CAI
• Authors: Zdenek Sawa, Petr Jancar
• Keywords: Acyclic Labelled Transition, Boolean Circuit Value, CAI 2005, Information Technology, Language Inclusion