Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email:

First Page		Document Content
Date: 2014-06-27 10:56:07 Computer science Büchi automaton Linear temporal logic Symbol Complementation of Büchi automaton Automata theory Theoretical computer science Formal methods		Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email: Add to Reading List Source URL: software.imdea.org Download Document from Source Website File Size: 350,60 KB Share Document on Facebook