Detailed Information on Publication Record
2002
Simulation Preorder over Simple Process Algebras
KUČERA, Antonín and Richard MAYRBasic information
Original name
Simulation Preorder over Simple Process Algebras
Authors
KUČERA, Antonín (203 Czech Republic, guarantor) and Richard MAYR (276 Germany)
Edition
Information and Computation, Academic Press, 2002, 0890-5401
Other information
Language
English
Type of outcome
Článek v odborném periodiku
Field of Study
20206 Computer hardware and architecture
Country of publisher
United States of America
Confidentiality degree
není předmětem státního či obchodního tajemství
Impact factor
Impact factor: 0.628
RIV identification code
RIV/00216224:14330/02:00005613
Organization unit
Faculty of Informatics
UT WoS
000174894900005
Keywords in English
concurrency; process algebras; simulation equivalence
Tags
International impact, Reviewed
Změněno: 22/11/2006 18:17, prof. RNDr. Antonín Kučera, Ph.D.
Abstract
V originále
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.
Links
| GA201/00/0400, research and development project |
| ||
| MSM 143300001, plan (intention) |
|