Bard Bloom

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 Lecture Notes in Computer Science	2023-08-16	Paper
Precongruence formats for decorated trace semantics ACM Transactions on Computational Logic	2017-07-12	Paper
On the expressive power of CCS Lecture Notes in Computer Science	2017-01-19	Paper
When is partial trace equivalence adequate? Formal Aspects of Computing	2000-08-14	Paper
Bisimulation can't be traced Journal of the ACM	1998-02-02	Paper
Structural operational semantics for weak bisimulations Theoretical Computer Science	1997-02-28	Paper
Turning SOS rules into equations Information and Computation	1994-06-19	Paper
Experimenting with process equivalence Theoretical Computer Science	1992-09-27	Paper
Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus Information and Computation	1992-06-25	Paper
scientific article; zbMATH DE number 4115933 (Why is no real title available?)	1989-01-01	Paper
Constructing two-writer atomic registers IEEE Transactions on Computers	1988-01-01	Paper

Research outcomes over time

This page was built for person: Bard Bloom