Reasoning about linear systems
Ursula Martin · 2007
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 Hoarestyle 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. We show by example how the rules can be used to inform development of a proof while a decision procedure automates the routine work.