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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F04%3A00010337%21RIV%2F2005%2FGA0%2F272405%2FN
rdf:type
n12:Vysledek skos:Concept
dcterms:description
In this paper we consider the problem of deciding bisimulation equivalence of a BPP and a finite-state system. We show that the problem can be solved in polynomial time and we present an algorithm deciding the problem in time O(n^4). The algorithm also constructs for each state of the finite-state system a `symbolic' semilinear representation of the set of all states of the BPP system which are bisimilar with this state. In this paper we consider the problem of deciding bisimulation equivalence of a BPP and a finite-state system. In this paper we consider the problem of deciding bisimulation equivalence of a BPP and a finite-state system. We show that the problem can be solved in polynomial time and we present an algorithm deciding the problem in time O(n^4). The algorithm also constructs for each state of the finite-state system a `symbolic' semilinear representation of the set of all states of the BPP system which are bisimilar with this state.
dcterms:title
Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time
skos:prefLabel
Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time
skos:notation
RIV/61989100:27240/04:00010337!RIV/2005/GA0/272405/N
n5:strany
73-81
n5:aktivita
n17:P n17:Z
n5:aktivity
P(GA201/03/1161), Z(MSM 272400013)
n5:dodaniDat
n6:2005
n5:domaciTvurceVysledku
n14:2066041
n5:druhVysledku
n11:D
n5:duvernostUdaju
n19:S
n5:entitaPredkladatele
n21:predkladatel
n5:idSjednocenehoVysledku
556379
n5:idVysledku
RIV/61989100:27240/04:00010337
n5:jazykVysledku
n7:eng
n5:klicovaSlova
bisimulation equivalence;basic parallel processes;finite-state processesence;basic parallel processes;finite-state processes
n5:klicoveSlovo
n13:basic%20parallel%20processes n13:bisimulation%20equivalence n13:finite-state%20processes n13:finite-state%20processesence
n5:kontrolniKodProRIV
[DF8D7B6FA88F]
n5:mistoKonaniAkce
Londýn
n5:mistoVydani
Londýn
n5:nazevZdroje
Proceedings of Infinity 2004 (A Satellite Workshop of CONCUR 2004)
n5:obor
n15:JC
n5:pocetDomacichTvurcuVysledku
1
n5:pocetTvurcuVysledku
2
n5:projekt
n9:GA201%2F03%2F1161
n5:rokUplatneniVysledku
n6:2004
n5:tvurceVysledku
Kot, M. Sawa, Zdeněk
n5:typAkce
n18:WRD
n5:zahajeniAkce
2004-09-28+02:00
n5:zamer
n16:MSM%20272400013
s:numberOfPages
9
n8:hasPublisher
Springer-Verlag
n10:organizacniJednotka
27240