First Page | Document Content | |
---|---|---|
Date: 2018-05-17 00:58:55Finite automata Temporal logic Model checking Theoretical computer science Formal methods Mathematical logic Linear temporal logic Computation tree logic Alternating finite automaton Generalized Bchi automaton Bchi automaton | Verifying the LTL to B¨ uchi Automata Translation via Very Weak Alternating Automata Simon Jantsch1 and Michael Norrish2 1Add to Reading ListSource URL: cakeml.orgDownload Document from Source WebsiteFile Size: 368,12 KBShare Document on Facebook |