About: Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds     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
  • We present a general method for proving DP-hardness of equivalence-checking problems on one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter automata. In this way we show that the membership problem for any relation subsuming bisimilarity and subsumed by simulation preorder is DP-hard (even) for one-counter nets (where the counter cannot be tested for zero). We also show DP-hardness for deciding simulation between one-counter automata and finite-state systems (in both directions).
  • We present a general method for proving DP-hardness of equivalence-checking problems on one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter automata. In this way we show that the membership problem for any relation subsuming bisimilarity and subsumed by simulation preorder is DP-hard (even) for one-counter nets (where the counter cannot be tested for zero). We also show DP-hardness for deciding simulation between one-counter automata and finite-state systems (in both directions). (en)
  • We present a general method for proving DP-hardness of equivalence-checking problems on one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter automata. In this way we show that the membership problem for any relation subsuming bisimilarity and subsumed by simulation preorder is DP-hard (even) for one-counter nets (where the counter cannot be tested for zero). We also show DP-hardness for deciding simulation between one-counter automata and finite-state systems (in both directions). (cs)
Title
  • Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
  • Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (en)
  • Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (cs)
skos:prefLabel
  • Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
  • Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (en)
  • Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (cs)
skos:notation
  • RIV/00216224:14330/02:00005571!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany
  • 172
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/00/0400), Z(MSM 143300001), Z(MSM 272400013)
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
  • 645211
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/02:00005571
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • concurrency; infinite-state systems; bisimilarity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [6ED132E2EBCA]
http://linked.open...v/mistoKonaniAkce
  • Grenoble, France, April 8-12, 2002
http://linked.open...i/riv/mistoVydani
  • Berlin, Heidelberg, New York
http://linked.open...i/riv/nazevZdroje
  • Proceedings of 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2002)
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...iv/tvurceVysledku
  • Kučera, Antonín
  • Jančar, Petr
  • Sawa, Zdeněk
  • Moller, Faron
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 3-540-43366-X
http://localhost/t...ganizacniJednotka
  • 14330
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software