Author of the publication

Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction.

, , , and . A Journey from Process Algebra via Timed Automata to Model Learning, volume 13560 of Lecture Notes in Computer Science, page 1-26. Springer, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Guest Editors' Foreword., and . Nord. J. Comput., 9 (1): 69 (2002)On a Question of A. Salomaa: The Equational Theory of Regular Expressions over a Singleton Alphabet is not Finitely Based, , and . Theoretical Computer Science, 209 (1-2): 141--162 (December 1998)Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)., and . Acta Inf., 54 (1): 1-2 (2017)On the Ill-Timed but Well-Caused., and . CONCUR, volume 715 of Lecture Notes in Computer Science, page 97-111. Springer, (1993)Towards Action-Refinement in Process Algebras, and . Inf. Comput., 103 (2): 204-269 (April 1993)Preface., , and . SOS@CONCUR, volume 128 of Electronic Notes in Theoretical Computer Science, page 1. Elsevier, (2004)On Probabilistic Monitorability., , , , , , and . Principles of Systems Design, volume 13660 of Lecture Notes in Computer Science, page 325-342. Springer, (2022)Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction., , , and . A Journey from Process Algebra via Timed Automata to Model Learning, volume 13560 of Lecture Notes in Computer Science, page 1-26. Springer, (2022)In search of lost time: Axiomatising parallel composition in process algebras., , , , and . LICS, page 1-14. IEEE, (2021)Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?, , , , and . CSL, volume 183 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)