Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basi - Ω-logic - Document - PDFSEARCH.IO

First Page	Meta Content
	Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basi Add to Reading List Document Date: 2013-04-11 05:48:57 Open Document File Size: 222,05 KB Share Result on Facebook Country Netherlands / / IndustryTerm trace-checking algorithm / trace-checking algorithms / reactive systems / breadthfirst algorithm / depth-first and reverse-traversal algorithms / satellite workshops / depth-first algorithm / depth-first traversal algorithm / runtime verification systems / / Organization Henny Sipma Computer Science Department / National Science Foundation / National Aeronautics and Space Administration / Stanford University Stanford / / Person Bernd Finkbeiner / / Product C-1693 / C-0096 / C-3014 / / ProgrammingLanguage Java / Verilog / C / C++ / / Technology traversal algorithm / three algorithms / present three algorithms / Verilog / Java / Runtime analysis algorithms / trace-checking algorithm / one algorithm / third algorithm / second algorithm / trace-checking algorithms / VHDL / reverse-traversal algorithms / breadthfirst algorithm / / SocialTag Logic Model theory Theoretical computer science Linear temporal logic Temporal logic Ω-automaton Model checking Interpretation Structure Automata theory

Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basiAdd to Reading List