Main Page | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | File Members

tgbaalgos/ltl2tgba_fm.hh File Reference

#include "ltlast/formula.hh"
#include "tgba/tgbaexplicit.hh"

Include dependency graph for ltl2tgba_fm.hh:

Include dependency graph

Go to the source code of this file.

Namespaces

namespace  spot

Functions

tgba_explicit * ltl_to_tgba_fm (const ltl::formula *f, bdd_dict *dict, bool exprop=false, bool symb_merge=true, bool branching_postponement=false, bool fair_loop_approx=false)
 Build a spot::tgba_explicit* from an LTL formula.


Function Documentation

tgba_explicit* ltl_to_tgba_fm const ltl::formula *  f,
bdd_dict *  dict,
bool  exprop = false,
bool  symb_merge = true,
bool  branching_postponement = false,
bool  fair_loop_approx = false
 

Build a spot::tgba_explicit* from an LTL formula.

This is based on the following paper.

      @InProceedings{couvreur.99.fm,
        author	  = {Jean-Michel Couvreur},
        title     = {On-the-fly Verification of Temporal Logic},
        pages     = {253--271},
        editor	  = {Jeannette M. Wing and Jim Woodcock and Jim Davies},
        booktitle = {Proceedings of the World Congress on Formal Methods in the
      		     Development of Computing Systems (FM'99)},
        publisher = {Springer-Verlag},
        series	  = {Lecture Notes in Computer Science},
        volume	  = {1708},
        year      = {1999},
        address	  = {Toulouse, France},
        month	  = {September},
        isbn      = {3-540-66587-0}
      }
      

Parameters:
f The formula to translate into an automata.
dict The spot::bdd_dict the constructed automata should use.
exprop When set, the algorithm will consider all properties combinations possible on each state, in an attempt to reduce the non-determinism. The automaton will have the same size as without this option, but because the transition will be more deterministic, the product automaton will be smaller (or, at worse, equal).
symb_merge When false, states with the same symbolic representation (these are equivalent formulae) will not be merged.
branching_postponement When set, several transitions leaving from the same state with the same label (i.e., condition + acceptance conditions) will be merged. This correspond to an optimization described in the following paper.
      @InProceedings{	  sebastiani.03.charme,
        author	  = {Roberto Sebastiani and Stefano Tonetta},
        title	  = {"More Deterministic" vs. "Smaller" B{\"u}chi Automata for
      		     Efficient LTL Model Checking},
        booktitle = {Proceedings for the 12th Advanced Research Working
      		     Conference on Correct Hardware Design and Verification
      		     Methods (CHARME'03)},
        pages     = {126--140},
        year      = {2003},
        editor	  = {G. Goos and J. Hartmanis and J. van Leeuwen},
        volume	  = {2860},
        series	  = {Lectures Notes in Computer Science},
        month     = {October},
        publisher = {Springer-Verlag}
      }
      
fair_loop_approx When set, a really simple characterization of unstable state is used to suppress all acceptance conditions from incoming transitions.
Returns:
A spot::tgba_explicit that recognizes the language of f.


Please comment this page and report errors about it on the RefDocComments page.
Generated on Fri Aug 13 14:43:09 2004 for spot by doxygen 1.3.8