Bard Bloom
From MaRDI portal
Person:673122
Available identifiers
zbMath Open bloom.bardMaRDI QIDQ673122
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| Trade-offs in true concurrency: Pomsets and mazurkiewicz traces | 2023-08-16 | Paper |
| Precongruence formats for decorated trace semantics | 2017-07-12 | Paper |
| On the expressive power of CCS | 2017-01-19 | Paper |
| When is partial trace equivalence adequate? | 2000-08-14 | Paper |
| Bisimulation can't be traced | 1998-02-02 | Paper |
| Structural operational semantics for weak bisimulations | 1997-02-28 | Paper |
| Turning SOS rules into equations | 1994-06-19 | Paper |
| Experimenting with process equivalence | 1992-09-27 | Paper |
| Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730757 | 1989-01-01 | Paper |
| Constructing two-writer atomic registers | 1988-01-01 | Paper |
Research outcomes over time
This page was built for person: Bard Bloom
