Other formats:
BibTeX
LaTeX
RIS
@article{401191, author = {Kučera, Antonín and Mayr, Richard}, article_number = {2}, keywords = {concurrency; process algebras; simulation equivalence}, language = {eng}, issn = {0890-5401}, journal = {Information and Computation}, title = {Simulation Preorder over Simple Process Algebras}, volume = {173}, year = {2002} }
TY - JOUR ID - 401191 AU - Kučera, Antonín - Mayr, Richard PY - 2002 TI - Simulation Preorder over Simple Process Algebras JF - Information and Computation VL - 173 IS - 2 SP - 184 EP - 184 PB - Academic Press SN - 08905401 KW - concurrency KW - process algebras KW - simulation equivalence N2 - 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. ER -
KUČERA, Antonín and Richard MAYR. Simulation Preorder over Simple Process Algebras. \textit{Information and Computation}. Academic Press, 2002, vol.~173, No~2, p.~184-198. ISSN~0890-5401.
|