This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n10http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n12http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n22http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F03%3A00008382%21RIV%2F2004%2FGA0%2F272404%2FN/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F03%3A00008382%21RIV%2F2004%2FGA0%2F272404%2FN
rdf:type
n12:Vysledek skos:Concept
dcterms: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.
dcterms:title
Equivalence Checking of Non-flat Systems Is EXPTIME-hard Equivalence Checking of Non-flat Systems Is EXPTIME-hard
skos:prefLabel
Equivalence Checking of Non-flat Systems Is EXPTIME-hard Equivalence Checking of Non-flat Systems Is EXPTIME-hard
skos:notation
RIV/61989100:27240/03:00008382!RIV/2004/GA0/272404/N
n3:strany
237-250
n3:aktivita
n15:P n15:Z
n3:aktivity
P(GA201/03/1161), Z(MSM 272400013)
n3:dodaniDat
n16:2004
n3:domaciTvurceVysledku
n18:2066041
n3:druhVysledku
n11:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n22:predkladatel
n3:idSjednocenehoVysledku
606130
n3:idVysledku
RIV/61989100:27240/03:00008382
n3:jazykVysledku
n4:eng
n3:klicovaSlova
equivalence checking, finite-state systems, complexity finite-state systems, complexity
n3:klicoveSlovo
n7:equivalence%20checking n7:complexity n7:finite-state%20systems n7:complexity%20finite-state%20systems
n3:kontrolniKodProRIV
[84C9630B4BE7]
n3:mistoKonaniAkce
Universite de Provence and Laboratoire d'Informa
n3:mistoVydani
Berlin Heidelberg
n3:nazevZdroje
Proceedings of CONCUR 2003 - Concurrency Theory
n3:obor
n21:BD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n13:GA201%2F03%2F1161
n3:rokUplatneniVysledku
n16:2003
n3:tvurceVysledku
Sawa, Zdeněk
n3:typAkce
n9:WRD
n3:zahajeniAkce
2003-01-01+01:00
n3:zamer
n14:MSM%20272400013
s:numberOfPages
14
n20:hasPublisher
Springer-Verlag. (Berlin; Heidelberg)
n17:isbn
3-540-40753-7
n10:organizacniJednotka
27240