( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.

, , , и . TACAS (1), том 10205 из Lecture Notes in Computer Science, стр. 426-442. (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Gisela Sickert

Dieter Sickert

Wolfgang Sickert

Christine Sickert

Fritz Sickert

 

Другие публикации лиц с тем же именем

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata., , , и . TACAS (1), том 10205 из Lecture Notes in Computer Science, стр. 426-442. (2017)LTL to Deterministic Emerson-Lei Automata., и . GandALF, том 256 из EPTCS, стр. 180-194. (2017)From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata, , , и . International Journal on Software Tools for Technology Transfer, 24 (4): 635--659 (2022)An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata., и . LICS, стр. 831-844. ACM, (2020)On the Translation of Automata to Linear Temporal Logic., , и . FoSSaCS, том 13242 из Lecture Notes in Computer Science, стр. 140-160. Springer, (2022)MoTraS: A Tool for Modal Transition Systems and Their Extensions., и . ATVA, том 8172 из Lecture Notes in Computer Science, стр. 487-491. Springer, (2013)Owl: A Library for ω-Words, Automata, and LTL., , и . ATVA, том 11138 из Lecture Notes in Computer Science, стр. 543-550. Springer, (2018)A Unified Translation of Linear Temporal Logic to ω-Automata, , и . J. ACM, (октября 2020)Efficient Normalization of Linear Temporal Logic., , и . CoRR, (2023)Certifying DFA Bounds for Recognition and Separation., , и . Innov. Syst. Softw. Eng., 18 (3): 405-416 (2022)