Del 0 - Monographs in Theoretical Computer Science. An EATCS Series

Process Algebra with Timing

Inbunden, Engelska, 2002

AvJ.C.M. Baeten,C.A. Middelburg

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

719 kr

Skickas inom 10-15 vardagar

Timing issues are of growing importance for the conceptualization and design of computer-based systems. Timing may simply be essential for the correct behaviour of a system, e. g. of a controller. Even if timing is not essential for the correct behaviour of a system, there may be good reasons to introduce it in such a way that suitable timing becomes relevant for the correct behaviour of a complex system. This book is unique in presenting four algebraic theories about processes, each dealing with timing from a different point of view, in a coherent and systematic way. The timing of actions is either relative or absolute and the underlying time scale is either discrete or continuous. All presented theories are extensions of the algebra of communicating processes. The book is essential reading for researchers and advanced students interested in timing issues in the context of the design and analysis of concurrent and communicating processes.

Produktinformation

Utgivningsdatum2002-07-04
Mått155 x 235 x 22 mm
Vikt635 g
FormatInbunden
SpråkEngelska
SerieMonographs in Theoretical Computer Science. An EATCS Series
Antal sidor287
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540434474

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

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.