Abstract

Regular languages have proved useful for the symbolic state exploration of infinite state systems. Regular languages can be used to represent infinite sets of system configurations, the transitional semantics of the system consequently can be modeled by finite-state transducers. A standard problem encountered when doing symbolic state exploration for in nite state systems is, how to explore all states in a finite amount of time. When representing the one-step transition relation of a system by a finite-state transducer T , this problem boils down to finding a finite-state representation for T , capturing the transitive closure of the one-step reduction relation. In this paper we give a semi-algorithm to compute T . The construction is based on building a quotient of an infinite-state representation, where the quotienting uses past and future bisimulations computed on finite approximations of T . As in general, T is not representable by a finite-state transducer, the constructi...

Citations