From post

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness.

, , , и . ICALP, том 198 из LIPIcs, стр. 142:1-142:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

 

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

Coalgebraic Learning.. CSL, том 62 из LIPIcs, стр. 5:1-5:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk).. FSCD, том 84 из LIPIcs, стр. 3:1-3:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Automata for Context-Dependent Connectors., , и . COORDINATION, том 5521 из Lecture Notes in Computer Science, стр. 184-203. Springer, (2009)A coinductive calculus of binary trees, и . Inf. Comput., 208 (5): 578-593 (мая 2010)SDN-Actors: Modeling and Verification of SDN Programs., , , , и . FM, том 10951 из Lecture Notes in Computer Science, стр. 550-567. Springer, (2018)A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests., , и . ESOP, том 13990 из Lecture Notes in Computer Science, стр. 309-336. Springer, (2023)A Completeness Theorem for Probabilistic Regular Expressions., и . CoRR, (2023)Processes Parametrised by an Algebraic Theory., , , и . ICALP, том 229 из LIPIcs, стр. 132:1-132:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Kleene Theorem for Nominal Automata., и . ICALP, том 132 из LIPIcs, стр. 107:1-107:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Multisets and Distributions., и . Logics and Type Systems in Theory and Practice, том 14560 из Lecture Notes in Computer Science, стр. 168-187. Springer, (2024)