About: Some Remarks on Weak Bisimilarity of BPA-Processes

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

About: Some Remarks on Weak Bisimilarity of BPA-Processes 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	The purpose of this work is to examine the decidability problem of weak bisimilarity for BPA-processes. It has been known that strong bisimilarity, which may be considered a special case of weak bisimilarity, where the internal (silent) action tau is treated equally to observable actions, is decidable for BPA-processes. For strong bisimilarity, these processes are finitely branching and so for two non-bisimilar processes there exists a level n that distinguishes the two processes. Additionally, from the decidability of whether two processes are equivalent at a given level n, semidecidability of strong non-bisimilarity directly follows. We examine the following two closely related approaches to semidecidability of strong equivalence: 1.construction of a (finite) bisimulation or expansion tree, 2.construction of a finite Caucal base. We have attempted to find out if any of the above mentioned approaches could be generalized to (semi)decide weak bisimilarity. Our findings indicate that a direct g The purpose of this work is to examine the decidability problem of weak bisimilarity for BPA-processes. It has been known that strong bisimilarity, which may be considered a special case of weak bisimilarity, where the internal (silent) action tau is treated equally to observable actions, is decidable for BPA-processes. For strong bisimilarity, these processes are finitely branching and so for two non-bisimilar processes there exists a level n that distinguishes the two processes. Additionally, from the decidability of whether two processes are equivalent at a given level n, semidecidability of strong non-bisimilarity directly follows. We examine the following two closely related approaches to semidecidability of strong equivalence: 1.construction of a (finite) bisimulation or expansion tree, 2.construction of a finite Caucal base. We have attempted to find out if any of the above mentioned approaches could be generalized to (semi)decide weak bisimilarity. Our findings indicate that a direct g (en)
Title	Some Remarks on Weak Bisimilarity of BPA-Processes Some Remarks on Weak Bisimilarity of BPA-Processes (en)
skos:prefLabel	Some Remarks on Weak Bisimilarity of BPA-Processes Some Remarks on Weak Bisimilarity of BPA-Processes (en)
skos:notation	RIV/00216224:14330/00:00002688!RIV/2002/GA0/143302/N
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/00/0400), P(GA201/99/D026), Z(MSM 143300001)
http://linked.open...vai/riv/dodaniDat	2002
http://linked.open...aciTvurceVysledku	Stříbrná, Jitka Černá, Ivana
http://linked.open.../riv/druhVysledku	B - Odborná kniha
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	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	727032
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/00:00002688
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Some Remarks on Weak Bisimilarity of BPA-Processes (en)
http://linked.open.../riv/klicoveSlovo	Some Remarks on Weak Bisimilarity of BPA-Processes
http://linked.open...ontrolniKodProRIV	[CCBC4C431528]
http://linked.open...i/riv/mistoVydani	Brno
http://linked.open...vEdiceCisloSvazku	FIMU-RS-2000-09
http://linked.open...i/riv/nazevZdroje	Some Remarks on Weak Bisimilarity of BPA-Processes
http://linked.open...in/vavai/riv/obor	BD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...v/pocetStranKnihy	26 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...vavai/riv/projekt	Decidability and complexity of observational equivalences on infinite - state processes Infinite state concurrent systems - models and verification
http://linked.open...UplatneniVysledku	2000
http://linked.open...iv/tvurceVysledku	Černá, Ivana Stříbrná, Jitka
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20143300001
number of pages	26 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Masarykova univerzita. Fakulta informatiky
http://localhost/t...ganizacniJednotka	14330

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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software