- Email: [email protected]
Reachability sets of parameterized rings as regular languages
Electronic Notes in Theoretical Computer Science www.elsevier.com/locate/entcs
Reachability sets of parameterized rings as regular languages Laurent Fribourg andHans Ols´en
Abstract We present here a method for deriving a regular language that characterizes the set of reachable states of a given parameterized ring (made of N identical components). The method basically proceeds in two steps: first one generates a regular language L by inductive inference from a finite sample of reachable states; second one formally checks that L characterizes the whole set of reachable states.
c 1571-0661/$ – see front matter 10.1016/S1571-0661(05)01644-0
Reachability sets of parameterized rings as regular languages Laurent Fribourg andHans Ols´en
Abstract We present here a method for deriving a regular language that characterizes the set of reachable states of a given parameterized ring (made of N identical components). The method basically proceeds in two steps: first one generates a regular language L by inductive inference from a finite sample of reachable states; second one formally checks that L characterizes the whole set of reachable states.
c 1571-0661/$ – see front matter 10.1016/S1571-0661(05)01644-0