Sciweavers

CAI
2005
Springer
13 years 4 months ago
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.,...
Zdenek Sawa, Petr Jancar