About: Equivalence Checking of Non-flat Systems Is EXPTIME-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 equivalence checking of systems that are given as a composition of interacting finite-state systems is considered. It is shown that the problem is EXPTIME-hard for any notion of equivalence that lies between bisimulation equivalence and trace equivalence, as conjectured by Rabinovich (1997). The result is proved for parallel composition of finite-state systems where hiding of actions is allowed, and for 1-safe Petri nets. The technique of the proof allows to extend this result easily to other types of `non-flat' systems.
  • The equivalence checking of systems that are given as a composition of interacting finite-state systems is considered. It is shown that the problem is EXPTIME-hard for any notion of equivalence that lies between bisimulation equivalence and trace equivalence, as conjectured by Rabinovich (1997). The result is proved for parallel composition of finite-state systems where hiding of actions is allowed, and for 1-safe Petri nets. The technique of the proof allows to extend this result easily to other types of `non-flat' systems. (en)
Title
  • Equivalence Checking of Non-flat Systems Is EXPTIME-hard
  • Equivalence Checking of Non-flat Systems Is EXPTIME-hard (en)
skos:prefLabel
  • Equivalence Checking of Non-flat Systems Is EXPTIME-hard
  • Equivalence Checking of Non-flat Systems Is EXPTIME-hard (en)
skos:notation
  • RIV/61989100:27240/03:00008382!RIV/2004/GA0/272404/N
http://linked.open.../vavai/riv/strany
  • 237-250
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/03/1161), 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
  • 606130
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/03:00008382
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • equivalence checking, finite-state systems, complexity finite-state systems, complexity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [84C9630B4BE7]
http://linked.open...v/mistoKonaniAkce
  • Universite de Provence and Laboratoire d'Informa
http://linked.open...i/riv/mistoVydani
  • Berlin Heidelberg
http://linked.open...i/riv/nazevZdroje
  • Proceedings of CONCUR 2003 - Concurrency Theory
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Sawa, Zdeněk
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. (Berlin; Heidelberg)
https://schema.org/isbn
  • 3-540-40753-7
http://localhost/t...ganizacniJednotka
  • 27240
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, 9 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software