Comparing the efficiency of asynchronous systems
- A timed process algebra is developed for evaluating the temporal worst-case efficiency of asynchronous concurrent systems. For the sake of simplicity, we use a classical CCS-like algebra where actions may occur arbitrarily within a continuous time interval, yielding arbitrary relative speeds of the components. Via the timed testing approach, asynchronous systems are then related w.r.t. their worst-case efficiency, yielding an efficiency preorder. We show that this preorder can just as well be based on much simpler discrete time and that it can be characterized with some kind of refusal traces. Finally, precongruence results are provided for all operators of the algebra, where prefix, choice and recursion require special attention.
| Author: | Lars JennerGND, Walter VoglerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-1640 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/213 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (1998-03) |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 1998 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/08 |
| GND-Keyword: | Nebenläufigkeit; Effizienzmessung |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik / Professur für Theorie verteilter Systeme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
