![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 13 November 2007, 13:00-14:00
Reasoning about Linear Systems
- 👤 Speaker: Rob Arthan (Lemma 1)
- 📅 Date & Time: Tuesday 13 November 2007, 13:00 - 14:00
- 📍 Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
Thomas Tuerk
Abstract
Speaker: Rob Arthan
We consider reasoning about linear systems expressed as block diagrams in a general relational setting. Using the notion of additive relation borrowed from homological algebra, the theory of weakest pre-conditions for these systems turns out to be very tractable and gives simple Hoare-style rules for the block diagram constructors. Many natural choices for the logical language used to express properties of linear systems admit a high degree of automation.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room SS03
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.