Beliebiger Eintrag,

Regular Model Checking made Simple and Efficient

, , , und .
(2002)

Zusammenfassung

We present a new technique for computing the transitive closure of a regular relation characterized by a finite-state transducer. The construction starts from the original transducer, and repeatedly adds new transitions which are compositions of currently existing transitions.

Tags

Nutzer

  • @giuliano.losa

Kommentare und Rezensionen