- About
- Events
- Calendar
- Graduation Information
- Cornell Learning Machines Seminar
- Student Colloquium
- BOOM
- Spring 2025 Colloquium
- Conway-Walker Lecture Series
- Salton 2024 Lecture Series
- Seminars / Lectures
- Big Red Hacks
- Cornell University / Cornell Tech - High School Programming Workshop and Contest 2025
- Game Design Initiative
- CSMore: The Rising Sophomore Summer Program in Computer Science
- Explore CS Research
- ACSU Research Night
- Cornell Junior Theorists' Workshop 2024
- People
- Courses
- Research
- Undergraduate
- M Eng
- MS
- PhD
- Admissions
- Current Students
- Computer Science Graduate Office Hours
- Advising Guide for Research Students
- Business Card Policy
- Cornell Tech
- Curricular Practical Training
- A & B Exam Scheduling Guidelines
- Fellowship Opportunities
- Field of Computer Science Ph.D. Student Handbook
- Graduate TA Handbook
- Field A Exam Summary Form
- Graduate School Forms
- Instructor / TA Application
- Ph.D. Requirements
- Ph.D. Student Financial Support
- Special Committee Selection
- Travel Funding Opportunities
- Travel Reimbursement Guide
- The Outside Minor Requirement
- Robotics Ph. D. prgram
- Diversity and Inclusion
- Graduation Information
- CS Graduate Minor
- Outreach Opportunities
- Parental Accommodation Policy
- Special Masters
- Student Spotlights
- Contact PhD Office
Title: Towards an Algebraic Theory of Systems
Abstract: Computer systems are built by composing together smaller components. This work aims to identify the key requirements for system composition, and introduces the concept of a 'system algebra', aiming to formalize various composition operations one can perform on systems. In this setting, the idea of composition-order invariance is formalized, which asserts that the order in which systems are composed or connected does not affect the final result. The framework is applicable to a variety of systems, including physical systems, electronic circuits, and distributed networks.
In addition, a hierarchy of useful "models" of this system algebra is presented. Of particular interest to Computer Science are 'functional system algebras' of which Kahn Networks and Causal Networks are prominent examples.
Bio: Suraaj Kanniwadi is a PhD student at Cornell University, advised by Andrew Myers. His research interests encompass systems, security, and programming languages.