Catálogo de publicaciones - libros

Compartir en
redes sociales

Concurrency Theory: Calculi and Automata for Modelling Untimed and Timed Concurrent Systems

Howard Bowman Rodolfo Gomez

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

Theory of Computation; Software Engineering; Logics and Meanings of Programs

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2006 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-1-85233-895-4

ISBN electrónico

978-1-84628-336-9

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer-Verlag London Limited 2006

Cobertura temática

computacion

Ciencias de la computación e información

Tabla de contenidos

doi: 10.1007/1-84628-336-1_11

Timed Communicating Automata

Howard Bowman; Rodolfo Gomez

IIR filters can give the same magnitude performance with fewer parameters than FIR filters. However, they cannot have exact linear phase. Their design is more complicated due to the difficulty in ensuring stability and to the nonconvexity of the optimization problems. In this short chapter, we give few guidelines for the optimization of IIR filters, insisting on algorithms that use positive polynomials.

Part IV - Concurrency Theory — Timed Models | Pp. 321-345

doi: 10.1007/1-84628-336-1_12

Timelocks in Timed Automata

Howard Bowman; Rodolfo Gomez

IIR filters can give the same magnitude performance with fewer parameters than FIR filters. However, they cannot have exact linear phase. Their design is more complicated due to the difficulty in ensuring stability and to the nonconvexity of the optimization problems. In this short chapter, we give few guidelines for the optimization of IIR filters, insisting on algorithms that use positive polynomials.

Part IV - Concurrency Theory — Timed Models | Pp. 347-376

doi: 10.1007/1-84628-336-1_13

Discrete Timed Automata

Howard Bowman; Rodolfo Gomez

IIR filters can give the same magnitude performance with fewer parameters than FIR filters. However, they cannot have exact linear phase. Their design is more complicated due to the difficulty in ensuring stability and to the nonconvexity of the optimization problems. In this short chapter, we give few guidelines for the optimization of IIR filters, insisting on algorithms that use positive polynomials.

Part IV - Concurrency Theory — Timed Models | Pp. 377-395