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

On the Axiomatizability of Priority III: The Return of Sequential Composition., , , , and . ICTCS, volume 2504 of CEUR Workshop Proceedings, page 145-157. CEUR-WS.org, (2019)Modal Decomposition on Nondeterministic Probabilistic Processes., , and . CONCUR, volume 59 of LIPIcs, page 36:1-36:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Rule Format for Rooted Branching Bisimulation., , and . CS&P, volume 1032 of CEUR Workshop Proceedings, page 49-60. CEUR-WS.org, (2013)Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics., , and . The Art of Modelling Computational Systems, volume 11760 of Lecture Notes in Computer Science, page 293-312. Springer, (2019)Raiders of the lost equivalence: Probabilistic branching bisimilarity., and . Inf. Process. Lett., (2020)Measuring Adaptability and Reliability of Large Scale Systems., , and . ISoLA (2), volume 12477 of Lecture Notes in Computer Science, page 380-396. Springer, (2020)A Function Elimination Method for Checking Satisfiability of Arithmetical Logics., , and . CS&P, volume 1269 of CEUR Workshop Proceedings, page 46-57. CEUR-WS.org, (2014)On the Axiomatisability of Parallel Composition: A Journey in the Spectrum., , , , and . CONCUR, volume 171 of LIPIcs, page 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Axiomatisation of Branching Bisimulation Congruence over CCS., , , and . CONCUR, volume 243 of LIPIcs, page 6:1-6:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Function Elimination Method for Checking Satisfiability of Arithmetical Logics., , and . Fundam. Informaticae, 143 (1-2): 51-71 (2016)