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.
%0 Generic
%1 Abdulla_regularmodel
%A Abdulla, Parosh Aziz
%A Jonsson, Bengt
%A Nilsson, Marcus
%A d'Orso, Julien
%D 2002
%K modelchecking regular
%T Regular Model Checking made Simple and Efficient
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.5864
%X 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.
@misc{Abdulla_regularmodel,
abstract = {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.},
added-at = {2010-01-06T17:33:51.000+0100},
author = {Abdulla, Parosh Aziz and Jonsson, Bengt and Nilsson, Marcus and d'Orso, Julien},
biburl = {https://www.bibsonomy.org/bibtex/2123d1d50d81638b633aa7d05af1ad307/giuliano.losa},
description = {Regular Model Checking made Simple and Efficient},
interhash = {8864e6e45dccf795cb82e902d3528958},
intrahash = {123d1d50d81638b633aa7d05af1ad307},
keywords = {modelchecking regular},
timestamp = {2010-01-06T17:33:51.000+0100},
title = {Regular Model Checking made Simple and Efficient},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.5864},
year = 2002
}