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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F04%3A00010073%21RIV08-MSM-14330___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
We show Sigma^1_1-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show Pi^1_1-hardness of weak omega-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes). V clanku je ukazana Sigma^1_1 uplnost slabe bisimilarity pro tridu PA a slabeho simulacniho predusporadani/ekvivalence pro zasobnikove automaty, PA a Petriho site. Rovnez jsou studovany problemy slabe omega-jazykove ekvivalence pro BPA a BPP. We show Sigma^1_1-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show Pi^1_1-hardness of weak omega-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).
dcterms:title
Highly Undecidable Questions for Process Algebras Highly Undecidable Questions for Process Algebras Vysoce nerozhodnutelne problemy pro algebry procesu
skos:prefLabel
Highly Undecidable Questions for Process Algebras Highly Undecidable Questions for Process Algebras Vysoce nerozhodnutelne problemy pro algebry procesu
skos:notation
RIV/00216224:14330/04:00010073!RIV08-MSM-14330___
n3:strany
?
n3:aktivita
n8:P n8:Z
n3:aktivity
P(GA201/03/1161), Z(MSM 143300001)
n3:dodaniDat
n4:2008
n3:domaciTvurceVysledku
n18:2753057
n3:druhVysledku
n10:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
566164
n3:idVysledku
RIV/00216224:14330/04:00010073
n3:jazykVysledku
n9:eng
n3:klicovaSlova
high undecidability; process rewrite systems; completeness
n3:klicoveSlovo
n11:completeness n11:high%20undecidability n11:process%20rewrite%20systems
n3:kontrolniKodProRIV
[2B73225CFFDE]
n3:mistoKonaniAkce
Toulouse, France
n3:mistoVydani
USA
n3:nazevZdroje
Proceedings of 3rd IFIP International Conference on Theoretical Computer Science (TCS'04)
n3:obor
n14:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n13:GA201%2F03%2F1161
n3:rokUplatneniVysledku
n4:2004
n3:tvurceVysledku
Srba, Jiří Jančář, Petr
n3:typAkce
n5:WRD
n3:zahajeniAkce
2004-01-01+01:00
n3:zamer
n15:MSM%20143300001
s:numberOfPages
14
n12:hasPublisher
Kluwer
n19:organizacniJednotka
14330