From post

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata.

, и . CSL, том 41 из LIPIcs, стр. 144-159. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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.

 

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

The complexity of soundness in workflow nets., , и . LICS, стр. 20:1-20:13. ACM, (2022)When is Containment Decidable for Probabilistic Automata?., , , , , и . ICALP, том 107 из LIPIcs, стр. 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Dynamic Data Structures for Timed Automata Acceptance., , , , и . IPEC, том 214 из LIPIcs, стр. 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Reachability for Bounded Branching VASS., и . CONCUR, том 140 из LIPIcs, стр. 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata., и . CSL, том 41 из LIPIcs, стр. 144-159. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework., , и . ICML, том 139 из Proceedings of Machine Learning Research, стр. 3640-3649. PMLR, (2021)Soundness of reset workflow nets., , , , и . LICS, стр. 13:1-13:14. ACM, (2024)Monus Semantics in Vector Addition Systems with States., , , и . CONCUR, том 279 из LIPIcs, стр. 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Reachability in Fixed Dimension Vector Addition Systems with States., , , , и . CONCUR, том 171 из LIPIcs, стр. 48:1-48:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Rational Recursive Sequences., , , и . STACS, том 254 из LIPIcs, стр. 24:1-24:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)