Analyzing LTL model checking techniques for plan synthesis and controller synthesis
In this paper, we present alternative means of handling invariances in reachability testing, either by formula progression or compilation into Büchi automata. These alternatives are presented in connection with three different applications of model check
|Collections||ANU Research Publications|
|Source:||Electronic Notes in Theoretical Computer Science|
|01_Kerjean_Analyzing_LTL_model_checking_2006.pdf||350.66 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.