Bibliographytheoretical background & nearby subjects tableaux methods & translating LTL to Büchi automata emptiness checks ω-automata partial orders fairness hierachies/classes of temporal logics counterexamples generation General overviews, surveys, or tutorials. Thesis or book chapters too big to fit in folders. 28cm = 11in
The computer science lab I work in is being relocated to another place in Paris. So while movers are having fun with our 13-storey building, I carried my paper collection home so I could work. This pile is almost everything I have to cite in my thesis. It's rather daunting, especially if you know that I printed most papers in a "two pages per side" layout to save paper. Fortunately it's already mostly sorted, annotated, and indexed.
This photo has notes. Move your mouse over the photo to see them.
CommentsWorld_Citizen
|
[?]
TagsAdditional Information
|
dmswart
says:
(to the tune of hakuna matata)
ω-automata: what a wonderful phrase.
ω-automata: ain't no passing phase.
I did my masters in theoretical computer science too (With Jeff Shallit). Sometimes I miss it.
My Erdos number is two - so that's nice.
Posted 37 months ago. ( permalink )