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: - Büchi automaton - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2014-06-27 10:56:07 Open Document File Size: 350,60 KB Share Result on Facebook City Madrid / / Country Spain / / / Facility C´esar S´anchez IMDEA Software Institute / Juli´an Samborski-Forlese IMDEA Software Institute / / IndustryTerm finite state systems / faster algorithms / / Organization Juli´an Samborski-Forlese IMDEA Software Institute / esar S´anchez IMDEA Software Institute / Institute for Information Security / / Person Hj / / Position coB / / ProgrammingLanguage C / / Technology two algorithms / / SocialTag 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