Other formats:
BibTeX
LaTeX
RIS
@article{639666,
author = {Kučera, Antonín and Schnoebelen, Philippe},
article_location = {Amsterdam, Nizozemí},
article_number = {2-3},
keywords = {concurrency; semantic equivalences; infinite-state systems},
language = {eng},
issn = {0304-3975},
journal = {Theoretical Computer Science},
title = {A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications},
volume = {358},
year = {2006}
}
TY - JOUR
ID - 639666
AU - Kučera, Antonín - Schnoebelen, Philippe
PY - 2006
TI - A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
JF - Theoretical Computer Science
VL - 358
IS - 2-3
SP - 315-333
EP - 315-333
PB - Elsevier
SN - 03043975
KW - concurrency
KW - semantic equivalences
KW - infinite-state systems
N2 - We introduce a generic family of behavioral relations for which the regular equivalence problem (i.e., comparing an arbitrary transition system to some finite-state specification) can be reduced to the model checking problem against simple modal formulae. As an application, we derive decidability of several regular equivalence problems for well-known families of infinite-state systems.
ER -
KUČERA, Antonín and Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. \textit{Theoretical Computer Science}. Amsterdam, Nizozemí: Elsevier, vol.~358, 2-3, p.~315-333. ISSN~0304-3975. 2006.
|
