( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Bounded Reachability Problems Are Decidable in FIFO Machines.

, , и . CONCUR, том 171 из LIPIcs, стр. 49:1-49:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Benedikt Bollig

Franzjosef Bollig

Beate Bollig

Heinrich Bollig

Hermann Bollig

 

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

Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search., , , , , , , , и . ICGI, том 153 из Proceedings of Machine Learning Research, стр. 113-129. PMLR, (2021)Property-Directed Verification and Robustness Certification of Recurrent Neural Networks., , , , , , , , , и . ATVA, том 12971 из Lecture Notes in Computer Science, стр. 364-380. Springer, (2021)Branch-Well-Structured Transition Systems and Extensions., , и . Log. Methods Comput. Sci., (2024)Reachability in Distributed Memory Automata., , и . CSL, том 183 из LIPIcs, стр. 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parallel Model Checking for the Alternation Free µ-Calculus., , и . TACAS, том 2031 из Lecture Notes in Computer Science, стр. 543-558. Springer, (2001)Local Parallel Model Checking for the Alternation-Free µ-Calculus., , и . SPIN, том 2318 из Lecture Notes in Computer Science, стр. 128-147. Springer, (2002)Round- and context-bounded control of dynamic pushdown systems., , и . Formal Methods Syst. Des., 62 (1): 41-78 (июня 2024)Realizability of Concurrent Recursive Programs., , и . FoSSaCS, том 5504 из Lecture Notes in Computer Science, стр. 410-424. Springer, (2009)Non-Sequential Theory of Distributed Systems., и . CoRR, (2019)On the Satisfiability of Local First-Order Logics with Data., , и . Log. Methods Comput. Sci., (2024)