Name: specification and compositional verification of real-time systems (en Inglés)
Price: 63250.00 CLP
Availability: InStock
Author: hooman
ISBN: 9783540549475

portada specification and compositional verification of real-time systems (en Inglés)

Formato

Libro Físico

Editorial

springer publishing map

Autor

hooman

Idioma

Inglés

N° páginas

235

ISBN

3540549471

ISBN13

9783540549475

Categorías

Ciencia y análisis de datos
Análisis y captura de datos

specification and compositional verification of real-time systems (en Inglés)

Hooman (Autor) · springer publishing map · Libro Físico

Libro Nuevo

$ 63.250

$ 126.500

Ahorras: $ 63.250

50% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Viernes 07 de Junio y el Miércoles 19 de Junio.

Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.

Reseña del libro "specification and compositional verification of real-time systems (en Inglés)"

the research described in this monograph concerns the formal specification and compositional verification of real-time systems. a real-time programminglanguage is considered in which concurrent processes communicate by synchronous message passing along unidirectional channels. to specifiy functional and timing properties of programs, two formalisms are investigated: one using a real-time version of temporal logic, called metric temporal logic, and another which is basedon extended hoare triples. metric temporal logic provides a concise notationto express timing properties and to axiomatize the programming language, whereas hoare-style formulae are especially convenient for the verification of sequential constructs. for both approaches a compositional proof system has been formulated to verify that a program satisfies a specification. to deduce timing properties of programs, first maximal parallelism is assumed, modeling the situation in which each process has itsown processor. next, this model is generalized to multiprogramming where several processes may share a processor and scheduling is based on priorities. the proof systems are shown to be sound and relatively complete with respect to a denotational semantics of the programming language. the theory is illustrated by an example of a watchdog timer.