On the complexity of rational verification

HIGHLIGHTS

• who: Julian Gutierrez from the Faculty of Information Technology, Monash University, Melbourne, Australia have published the article: On the complexity of rational verification, in the Journal: (JOURNAL)
• what: The authors show that the complexity of rational verification can be greatly reduced by restricting specifications to GR(1) a fragment of LTL that can represent a broad and practically useful class of response properties of reactive systems. The authors show that for a number of relevant settings rational verification can be done in polynomial space and even in polynomial time. The authors provide improved complexity results . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.