19 citations · 66 across the 24 of their papers we have counts for
20 papers · 1 filter
From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
Clemens Grabmayer
As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus…
Proceedings Twelfth International Workshop on Computing with Terms and Graphs
Clemens Grabmayer
The workshop TERMGRAPH 2022 took place at Technion in Haifa, Israel, on August 1, 2022, in the Pre-FLoC workshop block (July 31-August 1) of FLoC 2022 (Federated Logic Conference 2…
The Image of the Process Interpretation of Regular Expressions is Not Closed under Bisimulation Collapse
Clemens Grabmayer
Axiomatization and expressibility problems for Milner's process semantics (1984) of regular expressions modulo bisimilarity have turned out to be difficult for the full class of ex…
Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions)
Clemens Grabmayer
Milner (1984) defined a process semantics for regular expressions. He formulated a sound proof system for bisimilarity of process interpretations of regular expressions, and asked…
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
Clemens Grabmayer
Milner (1984) defined an operational semantics for regular expressions as finite-state processes. In order to axiomatize bisimilarity of regular expressions under this process sema…
A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity
Clemens Grabmayer
By adapting Salomaa's complete proof system for equality of regular expressions under the language semantics, Milner (1984) formulated a sound proof system for bisimilarity of regu…