A Comprehensive Comparison of TemporalFormula to Automaton TranslationAlgorithms
碩士 === 臺灣大學 === 資訊管理學研究所 === 98 === Translation of a temporal formula into an automaton is a central issue in the automatabased approach to model checking. In the approach, model checking of a system M against a temporal specification f proceeds in three steps: (1) generate an automaton A¬f for the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/88764493081596868527 |