Back to Results
First PageMeta Content
Computer science / Ω-automaton / Deterministic finite automaton / Nondeterministic finite automaton / Linear temporal logic / Finite-state machine / Symbol / Büchi automaton / Automata theory / Theoretical computer science / Formal methods


How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 1
Add to Reading List

Document Date: 2014-06-27 10:56:07

Open Document

File Size: 325,42 KB

Share Result on Facebook

City

Madrid / /

Company

G(A e w) Ae / VF / /

Country

Spain / /

/

Facility

IMDEA Software Institute / Spain Institute / /

IndustryTerm

reactive systems / /

Organization

Spain Institute for Applied Physics / IMDEA Software Institute / /

Position

Player / VP position / VP / VP positions / VP / EA / /

ProgrammingLanguage

C / /

SocialTag