Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436561 | Theoretical Computer Science | 2006 | 19 Pages |
Abstract
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 Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics