Process Algebra with Timing

1. Auflage. Softcover version of original hardcover Auflage 2002
ISBN: 978-3-642-07788-3
Verlag: Springer

Buch, Englisch, 287 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 476 g

Reihe: Monographs in Theoretical Computer Science. An EATCS Series

This book is concerned with a number of theories that can be used for describ­ ing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior. Society is becoming increasingly more dependent on complex computer­ based systems that are composed of several components that act concurrently and interact - to synchronize and communicate with each other. The com­ plexity of these systems arises to a great extent from the many ways in which their components can interact. The need that these components act and in­ teract on time as well adds considerably to the complexity. In developing such a system, it is important to be able to acquire a better understanding of the relevant issues at the conceptual level, to describe the system in a precise way at various levels of detail, and to analyze it on the basis of the descriptions. When the early algebraic theories about processes, such as ACP [16, 17, 20], CCS [49, 50] and CSP [27, 39], were developed for that purpose, the established opinion was still that timing is a concern that can more often than not be treated independently. It is therefore not surprising that timing is deliberately ignored in those theories. They have now all been extended to deal with timing.

Zielgruppe

Research

Autoren/Hrsg.

Middelburg, C. A.

Baeten, J.C.M.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Kybernetik, Systemtheorie, Komplexe Systeme
• Mathematik | Informatik Mathematik Algebra Lineare und multilineare Algebra, Matrizentheorie
• Mathematik | Informatik Mathematik Mathematik Interdisziplinär Systemtheorie
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur

Inhaltsverzeichnis

1. No Timing.- 2. Discrete Relative Timing.- 3. Discrete Absolute Timing.- 4. Continuous Relative Timing.- 5. Continuous Absolute Timing.- 6. Abstraction.- 7. Features.- A.1 Elimination.- A.2 Soundness.- A.3 Completeness.- B. Background Material.- B.1 Basic Equational Logic and SOS Theory.- B.1.1 Equational Logic.- B.1.2 SOS Theory.- B.2 Some Further Topics.- B.2.1 TSSs with Negative Premises.- B.2.2 Variable Binding Operators.- B.2.3 Conservativity and Completeness.- B.2.4 Generalizations.- B.2.5 Given Sorts and Parametrization.- B.3 Non-negative Real Numbers.- References.