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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F06%3A00015292%21RIV10-GA0-14330___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes by showing that the equivalence remains undecidable for weakly extended versions of BPA and BPP. In fact, we show that the weak bisimulation equivalence problem is undecidable even for normed subclasses of BPA and BPP extended with a finite constraint system. Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes by showing that the equivalence remains undecidable for weakly extended versions of BPA and BPP. In fact, we show that the weak bisimulation equivalence problem is undecidable even for normed subclasses of BPA and BPP extended with a finite constraint system.
dcterms:title
Refining Undecidability Border of Weak Bisimilarity. Refining Undecidability Border of Weak Bisimilarity.
skos:prefLabel
Refining Undecidability Border of Weak Bisimilarity. Refining Undecidability Border of Weak Bisimilarity.
skos:notation
RIV/00216224:14330/06:00015292!RIV10-GA0-14330___
n3:aktivita
n12:P n12:Z
n3:aktivity
P(1ET408050503), P(1M0545), P(GD102/05/H050), Z(MSM0021622419)
n3:dodaniDat
n8:2010
n3:domaciTvurceVysledku
n13:5598095 n13:8986371 n13:3978915
n3:druhVysledku
n7:D
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
496824
n3:idVysledku
RIV/00216224:14330/06:00015292
n3:jazykVysledku
n10:eng
n3:klicovaSlova
process rewrite systems; state extension; infinite-state; decidability; weak bisimilarity
n3:klicoveSlovo
n5:process%20rewrite%20systems n5:infinite-state n5:decidability n5:weak%20bisimilarity n5:state%20extension
n3:kontrolniKodProRIV
[C9BCAED1B586]
n3:mistoKonaniAkce
San Francisco, USA
n3:mistoVydani
Amsterdam, The Netherlands
n3:nazevZdroje
Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05)
n3:obor
n14:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n9:1ET408050503 n9:1M0545 n9:GD102%2F05%2FH050
n3:rokUplatneniVysledku
n8:2006
n3:tvurceVysledku
Křetínský, Mojmír Strejček, Jan Řehák, Vojtěch
n3:typAkce
n4:WRD
n3:zahajeniAkce
2005-01-01+01:00
n3:zamer
n17:MSM0021622419
s:issn
1571-0661
s:numberOfPages
20
n20:hasPublisher
Elsevier Science
n19:organizacniJednotka
14330