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
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
n6http://linked.opendata.cz/resource/domain/vavai/zamer/
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F03%3A00008471%21RIV08-MSM-14330___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F03%3A00008471%21RIV08-MSM-14330___
rdf:type
n14:Vysledek skos:Concept
dcterms:description
History preserving bisimilarity (hp-bisimilarity) and hereditary history preserving bisimilarity (hhp-bisimilarity) are behavioural equivalences taking into account causal relationships between events of concurrent systems. Their prominent feature is that they are preserved under action refinement, an operation important for the top-down design of concurrent systems. It is shown that, in contrast to hp-bisimilarity, checking hhp-bisimilarity for finite labelled asyn\-chro\-nous transition systems is undecidable, by a reduction from the halting problem of 2-counter machines. To make the proof more transparent a novel intermediate problem of checking domino bisimilarity for origin constrained tiling systems is introduced and shown undecidable. It is also shown that the unlabelled domino bisimilarity problem is undecidable, which implies undecidability of hhp-bisimilarity for unlabelled finite asynchronous systems. Moreover, it is argued that the undecidability of hhp-bisimilarity holds for finite elemen History preserving bisimilarity (hp-bisimilarity) and hereditary history preserving bisimilarity (hhp-bisimilarity) are behavioural equivalences taking into account causal relationships between events of concurrent systems. Their prominent feature is that they are preserved under action refinement, an operation important for the top-down design of concurrent systems. It is shown that, in contrast to hp-bisimilarity, checking hhp-bisimilarity for finite labelled asyn\-chro\-nous transition systems is undecidable, by a reduction from the halting problem of 2-counter machines. To make the proof more transparent a novel intermediate problem of checking domino bisimilarity for origin constrained tiling systems is introduced and shown undecidable. It is also shown that the unlabelled domino bisimilarity problem is undecidable, which implies undecidability of hhp-bisimilarity for unlabelled finite asynchronous systems. Moreover, it is argued that the undecidability of hhp-bisimilarity holds for finite elemen History preserving bisimilarity (hp-bisimilarity) and hereditary history preserving bisimilarity (hhp-bisimilarity) are behavioural equivalences taking into account causal relationships between events of concurrent systems. Their prominent feature is that they are preserved under action refinement, an operation important for the top-down design of concurrent systems. It is shown that, in contrast to hp-bisimilarity, checking hhp-bisimilarity for finite labelled asyn\-chro\-nous transition systems is undecidable, by a reduction from the halting problem of 2-counter machines. To make the proof more transparent a novel intermediate problem of checking domino bisimilarity for origin constrained tiling systems is introduced and shown undecidable. It is also shown that the unlabelled domino bisimilarity problem is undecidable, which implies undecidability of hhp-bisimilarity for unlabelled finite asynchronous systems. Moreover, it is argued that the undecidability of hhp-bisimilarity holds for finite elemen
dcterms:title
Undecidability of Domino Games and Hhp-Bisimilarity Undecidability of Domino Games and Hhp-Bisimilarity Undecidability of Domino Games and Hhp-Bisimilarity
skos:prefLabel
Undecidability of Domino Games and Hhp-Bisimilarity Undecidability of Domino Games and Hhp-Bisimilarity Undecidability of Domino Games and Hhp-Bisimilarity
skos:notation
RIV/00216224:14330/03:00008471!RIV08-MSM-14330___
n4:strany
343-368
n4:aktivita
n11:Z n11:P
n4:aktivity
P(GA201/03/1161), Z(MSM 143300001)
n4:cisloPeriodika
2
n4:dodaniDat
n10:2008
n4:domaciTvurceVysledku
n19:2753057
n4:druhVysledku
n16:J
n4:duvernostUdaju
n7:S
n4:entitaPredkladatele
n15:predkladatel
n4:idSjednocenehoVysledku
632049
n4:idVysledku
RIV/00216224:14330/03:00008471
n4:jazykVysledku
n17:eng
n4:klicovaSlova
partial order; bisimilarity; domino games
n4:klicoveSlovo
n12:partial%20order n12:domino%20games n12:bisimilarity
n4:kodStatuVydavatele
NL - Nizozemsko
n4:kontrolniKodProRIV
[581C40EE1EB6]
n4:nazevZdroje
Information and Computation
n4:obor
n8:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n13:GA201%2F03%2F1161
n4:rokUplatneniVysledku
n10:2003
n4:svazekPeriodika
184
n4:tvurceVysledku
Mogens, Nielsen Jurdzinski, Martin Srba, Jiří
n4:zamer
n6:MSM%20143300001
s:numberOfPages
26
n18:organizacniJednotka
14330