Skip to main content
PRL Project

KnowledgeBase » Seminar SEMINAR » ID = 518

IO-automata and Ensemble

by Mark Bickford
1999-2000

I'll be talking about modeling Ensemble protocol layers with IO-automata and proving propoerties of them. I'll show a simplified version of the Total-Ordering layer and its invariants.

I'll also talk about how we try to automate, to some extent, the task of proving invariants of IO-automata using a meta-theorem.

Slides

PRL Home
Introduction
The Nuprl book
Origins of the PRL Project
Goals
Dynamics of the Project
Mathematical Expression in Nuprl
Cross Links to Math & CS Fields
Knowledge Base
Math Library
Publications
Projects
CRASH
Nuprl/FDL System
EventML Software
Seminar
People
Wiki
The Book
Lectures
Other Groups


Website feedback
PRL Project   |   Computer Science Department   |   Cornell University
nuprl@cs.cornell.edu   |   320 Gates Hall, Ithaca, NY 14853   |   © 2014 Cornell University
site admin | Prof Constable's Library