About: Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In this paper we consider the problem of deciding bisimulation equivalence of a BPP and a finite-state system. (cs) 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. 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. (en)
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 (en) Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time (cs)
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 (en) Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time (cs)
skos:notation	RIV/61989100:27240/04:00010337!RIV/2005/GA0/272405/N
http://linked.open.../vavai/riv/strany	73-81
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/03/1161), Z(MSM 272400013)
http://linked.open...vai/riv/dodaniDat	2005
http://linked.open...aciTvurceVysledku	Sawa, Zdeněk
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	556379
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/04:00010337
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	bisimulation equivalence;basic parallel processes;finite-state processesence;basic parallel processes;finite-state processes (en)
http://linked.open.../riv/klicoveSlovo	bisimulation equivalence basic parallel processes finite-state processes finite-state processesence
http://linked.open...ontrolniKodProRIV	[DF8D7B6FA88F]
http://linked.open...v/mistoKonaniAkce	Londýn
http://linked.open...i/riv/mistoVydani	Londýn
http://linked.open...i/riv/nazevZdroje	Proceedings of Infinity 2004 (A Satellite Workshop of CONCUR 2004)
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Verification of infinite-state systems
http://linked.open...UplatneniVysledku	2004
http://linked.open...iv/tvurceVysledku	Sawa, Zdeněk Kot, M.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2004-09-28 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20272400013
number of pages	9 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software