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

Warning

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

KUČERA Antonín SCHNOEBELEN Philippe

Year of publication 2006
Type Article in Periodical
Magazine / Source Theoretical Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords concurrency; semantic equivalences; infinite-state systems
Description 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.
Related projects:

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