About: Behavioural Equivalences on Finite-State Systems are PTIME-hard     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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ázar, Gabarró and Sántha (1992) for bisimilarity.
  • 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ázar, Gabarró and Sántha (1992) for bisimilarity. (en)
  • 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ázar, Gabarró and Sántha (1992) for bisimilarity. (cs)
Title
  • Behavioural Equivalences on Finite-State Systems are PTIME-hard
  • Behavioural Equivalences on Finite-State Systems are PTIME-hard (en)
  • Behavioural Equivalences on Finite-State Systems are PTIME-hard (cs)
skos:prefLabel
  • Behavioural Equivalences on Finite-State Systems are PTIME-hard
  • Behavioural Equivalences on Finite-State Systems are PTIME-hard (en)
  • Behavioural Equivalences on Finite-State Systems are PTIME-hard (cs)
skos:notation
  • RIV/61989100:27240/05:00012189!RIV06-GA0-27240___
http://linked.open.../vavai/riv/strany
  • 513-528
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/03/1161)
http://linked.open...iv/cisloPeriodika
  • 5
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 513638
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/05:00012189
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • verification; finite transition systems; bisimulation equivalence; trace equivalence; computational complexity; PTIME-hardness (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • SK - Slovenská republika
http://linked.open...ontrolniKodProRIV
  • [FC36788DADCC]
http://linked.open...i/riv/nazevZdroje
  • Computing and Informatics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 24
http://linked.open...iv/tvurceVysledku
  • Jančar, Petr
  • Sawa, Zdeněk
issn
  • 1335-9150
number of pages
http://localhost/t...ganizacniJednotka
  • 27240
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software