A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
| KUČERA, Antonín and Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. P. Gardner, N. Yoshida (Eds.). In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin: Springer, 2004, p. 371-386. ISBN 3-540-22940-X. |
|
Other formats:
BibTeX
LaTeX
RIS
|
| Basic information | |
|---|---|
| Original name | A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications |
| Name in Czech | Obecný přístup k sémantickému porovnávání nekonečně-stavových systémů s jejich konečně-stavovými specifikacemi |
| Authors | KUČERA, Antonín (203 Czech Republic, guarantor) and Philippe SCHNOEBELEN (250 France). P. Gardner, N. Yoshida (Eds.). |
| Edition | Berlin, Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004), p. 371-386, 16 pp. 2004. |
| Publisher | Springer |
| Other information | |
|---|---|
| Original language | English |
| Type of outcome | Proceedings paper |
| Field of Study | 10201 Computer sciences, information science, bioinformatics |
| Country of publisher | Germany |
| Confidentiality degree | is not subject to a state or trade secret |
| RIV identification code | RIV/00216224:14330/04:00010252 |
| Organization unit | Faculty of Informatics |
| ISBN | 3-540-22940-X |
| UT WoS | 000223795700024 |
| Keywords in English | verification; semantic equivalences; infinite-state systems |
| Tags | infinite-state systems, semantic equivalences, verification |
| Tags | International impact, Reviewed |
| Changed by | Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 17:28. |
| Abstract |
|---|
| We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a 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. |
| Abstract (in Czech) |
|---|
| V článku je definována abstraktní sémantická ekvivalence, pro kterou je možné problém ekvivalence s daným konečně-stavovým procesem redukovat na problém ověření platnosti formule jednoduché modální logiky. Aplikací této metody je získána řada nových výsledků o rozhodnutelnosti a složitosti problému ověřování sémantických ekvivalencí mezi nekonečně-stavovými a konečně-stavovými procesy. |
| Links | |
|---|---|
| GA201/03/1161, research and development project | Name: Verifikace nekonečně stavových systémů |
| Investor: Czech Science Foundation, Verification of infinite-state systems | |
| MSM 143300001, plan (intention) | Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů |
| Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing | |
PrintDisplayed: 26/4/2024 08:18