Catálogo de publicaciones - libros
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
2006
Información sobre derechos de publicación
© Springer-Verlag London Limited 2006
Cobertura temática
Tabla de contenidos
Background on Concurrency Theory
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 I - Introduction | Pp. 3-13
Process Calculi: LOTOS
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 II - Concurrency Theory — Untimed Models | Pp. 19-54
Basic Interleaved Semantic Models
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 II - Concurrency Theory — Untimed Models | Pp. 55-104
True Concurrency Models: Event Structures
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 II - Concurrency Theory — Untimed Models | Pp. 105-139
Testing Theory and the Linear Time — Branching Time Spectrum
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 II - Concurrency Theory — Untimed Models | Pp. 141-180
Beyond pbLOTOS
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 III - Concurrency Theory — Further Untimed Notations | Pp. 185-214
Comparison of LOTOS with CCS and CSP
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 III - Concurrency Theory — Further Untimed Notations | Pp. 215-232
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 III - Concurrency Theory — Further Untimed Notations | Pp. 233-255
Timed Process Calculi, a LOTOS Perspective
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. 261-286
Semantic Models for tLOTOS
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. 287-320