Anbieter: PsychoBabel & Skoob Books, Didcot, Vereinigtes Königreich
EUR 8,21
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Very Good. Zustand des Schutzumschlags: No Dust Jacket. Lecture Notes in Computer Science 558; Ex-Library. Previous owner's sticker on the front cover. Ink stamp on half-title page. Library catalogue sticker inside front cover. Faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 62,21
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Springer Berlin Heidelberg, 1991
ISBN 10: 3540549471 ISBN 13: 9783540549475
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 53,49
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The research described in this monograph concerns the formalspecification and compositional verification of real-timesystems. A real-time programminglanguage is considered inwhich concurrent processes communicate by synchronousmessage passing along unidirectional channels. To specifiyfunctional and timing properties of programs, two formalismsare investigated: one using a real-time version of temporallogic, called Metric Temporal Logic, and another which isbasedon extended Hoare triples. Metric Temporal Logicprovides a concise notationto express timing properties andto axiomatize the programming language, whereas Hoare-styleformulae are especially convenient for the verification ofsequential constructs. For both approaches a compositionalproof system has been formulated to verify that a programsatisfies a specification. To deduce timing properties ofprograms, first maximal parallelism is assumed, modeling thesituation in which each process has itsown processor. Next,this model is generalized to multiprogramming where severalprocesses may share a processor and scheduling is based onpriorities. The proof systems are shown to be sound andrelatively complete with respect to a denotational semanticsof the programming language. The theory is illustrated by anexample of a watchdog timer.