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

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

Namespace Prefixes

PrefixIRI
n5http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n12http://purl.org/net/nknouf/ns/bibtex#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F03%3A00008469%21RIV08-MSM-14330___/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n4http://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/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F03%3A00008469%21RIV08-MSM-14330___
rdf:type
n16:Vysledek skos:Concept
dcterms:description
We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine several proof techniques to provide a reduction from Post's correspondence problem to our problem: existential quantification technique, masking technique and deadlock elimination technique. We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine several proof techniques to provide a reduction from Post's correspondence problem to our problem: existential quantification technique, masking technique and deadlock elimination technique. We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine several proof techniques to provide a reduction from Post's correspondence problem to our problem: existential quantification technique, masking technique and deadlock elimination technique.
dcterms:title
Undecidability of Weak Bisimilarity for PA-Processes Undecidability of Weak Bisimilarity for PA-Processes Undecidability of Weak Bisimilarity for PA-Processes
skos:prefLabel
Undecidability of Weak Bisimilarity for PA-Processes Undecidability of Weak Bisimilarity for PA-Processes Undecidability of Weak Bisimilarity for PA-Processes
skos:notation
RIV/00216224:14330/03:00008469!RIV08-MSM-14330___
n3:strany
197-208
n3:aktivita
n10:Z n10:P
n3:aktivity
P(GA201/03/1161), Z(MSM 143300001)
n3:dodaniDat
n11:2008
n3:domaciTvurceVysledku
n18:2753057
n3:druhVysledku
n20:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
632050
n3:idVysledku
RIV/00216224:14330/03:00008469
n3:jazykVysledku
n19:eng
n3:klicovaSlova
weak bisimilarity; undecidability; PA-processes
n3:klicoveSlovo
n8:PA-processes n8:weak%20bisimilarity n8:undecidability
n3:kontrolniKodProRIV
[1085C281DAD1]
n3:mistoKonaniAkce
Kyoto, Japan
n3:mistoVydani
Netherlands
n3:nazevZdroje
Proceedings of 6th International Conference on Developments in Language Theory (DLT'02),
n3:obor
n9:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n14:GA201%2F03%2F1161
n3:rokUplatneniVysledku
n11:2003
n3:tvurceVysledku
Srba, Jiří
n3:typAkce
n5:WRD
n3:zahajeniAkce
2002-01-01+01:00
n3:zamer
n4:MSM%20143300001
s:numberOfPages
12
n12:hasPublisher
Springer-Verlag
n21:organizacniJednotka
14330