Behavioural equivalences on finite-state systems are PTIME-hard
Loading...
Downloads
0
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Slovenská akadémia vied. Ústav informatiky
Location
Ve fondu ÚK
Signature
Abstract
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 (ie, language inclusion) is PTIME-hard, even for finite acyclic labelled transition systems. This reproves and substantially extends the result of Balcazar, Gabarro and Santha (1992) for bisimilarity.
Description
Subject(s)
verification, finite transition systems, bisimulation equivalence, trace equivalence, computational complexity, PTIME-hardness
Citation
Computing and Informatics. 2005, vol. 24, no. 5, p. 513-528.