Behavioural equivalences on finite-state systems are PTIME-hard

Show simple item record
dc.contributor.authorSawa, Zdeněk
dc.contributor.authorJančar, Petr
dc.date.accessioned2006-10-04T13:03:56Z
dc.date.available2006-10-04T13:03:56Z
dc.date.issued2005
dc.description.abstractThe 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.en
dc.identifier.citationComputing and Informatics. 2005, vol. 24, no. 5, p. 513-528.en
dc.identifier.issn1335-9150
dc.identifier.locationVe fondu ÚKen
dc.identifier.urihttp://hdl.handle.net/10084/56836
dc.identifier.wos000235545600005
dc.language.isoenen
dc.publisherSlovenská akadémia vied. Ústav informatikyen
dc.relation.ispartofseriesComputing and Informaticsen
dc.subjectverificationen
dc.subjectfinite transition systemsen
dc.subjectbisimulation equivalenceen
dc.subjecttrace equivalenceen
dc.subjectcomputational complexityen
dc.subjectPTIME-hardnessen
dc.titleBehavioural equivalences on finite-state systems are PTIME-harden
dc.typearticleen

Files

Collections

Publikační činnost VŠB-TUO ve Web of Science / Publications of VŠB-TUO in Web of Science
Publikační činnost Katedry informatiky / Publications of Department of Computer Science (460)