About: Simulation Preorder over Simple Process Algebras

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

About: Simulation Preorder over Simple Process Algebras 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	We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows to design effective reductions of simulation problems to their bisimulation counterparts and some new decidability results for simulation have already been obtained in this way. Then we establish the decidability/tractability border for the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones w.r.t. the hierarchy of process rewrite systems. We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows to design effective reductions of simulation problems to their bisimulation counterparts and some new decidability results for simulation have already been obtained in this way. Then we establish the decidability/tractability border for the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones w.r.t. the hierarchy of process rewrite systems. (en) We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows to design effective reductions of simulation problems to their bisimulation counterparts and some new decidability results for simulation have already been obtained in this way. Then we establish the decidability/tractability border for the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones w.r.t. the hierarchy of process rewrite systems. (cs)
Title	Simulation Preorder over Simple Process Algebras Simulation Preorder over Simple Process Algebras (en) Simulation Preorder over Simple Process Algebras (cs)
skos:prefLabel	Simulation Preorder over Simple Process Algebras Simulation Preorder over Simple Process Algebras (en) Simulation Preorder over Simple Process Algebras (cs)
skos:notation	RIV/00216224:14330/02:00005613!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany	184
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/00/0400), Z(MSM 143300001)
http://linked.open...iv/cisloPeriodika	2
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Kučera, Antonín
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	663642
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/02:00005613
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	concurrency; process algebras; simulation equivalence (en)
http://linked.open.../riv/klicoveSlovo	concurrency process algebras simulation equivalence
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[D25F5409DC4C]
http://linked.open...i/riv/nazevZdroje	Information and Computation
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	Infinite state concurrent systems - models and verification
http://linked.open...UplatneniVysledku	2002
http://linked.open...v/svazekPeriodika	173
http://linked.open...iv/tvurceVysledku	Kučera, Antonín Mayr, Richard
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20143300001
issn	0890-5401
number of pages	15 (xsd:int)
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software