Reasoning about linear systems

Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of 5th IEEE International Conference on Software Engineering and Formal Methods SEFM
Pages123-134
Number of pages10
Publication statusPublished - 2007
EventIEEE International Conference on Software Engineering and Formal Methods 2007 - London, United Kingdom
Duration: 10 Sep 200714 Sep 2007

Conference

ConferenceIEEE International Conference on Software Engineering and Formal Methods 2007
Abbreviated titleSEFM 2007
Country/TerritoryUnited Kingdom
CityLondon
Period10/09/0714/09/07

Fingerprint

Dive into the research topics of 'Reasoning about linear systems'. Together they form a unique fingerprint.

Cite this