A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
| Authors | |
|---|---|
| Year of publication | 2004 |
| Type | Article in Proceedings |
| Conference | Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004) |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | verification; semantic equivalences; infinite-state systems |
| Description | 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. |
| Related projects: |