A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications

Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

KUČERA Antonín SCHNOEBELEN Philippe

Year of publication 2004
Type Article in Proceedings
Conference Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004)
MU Faculty or unit

Faculty of Informatics

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:

You are running an old browser version. We recommend updating your browser to its latest version.

More info