Time and fairness in a process algebra with non-blocking reading

  • We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems, and we do it in two different ways: one is more flexible, the other is simpler since it needs only one type of transitions. We study the impact this new kind of actions have on fairness, liveness and the timing of systems, using Dekker's mutual exclusion algorithm we already considered in earlier work as running example. Regarding some actions as reading, this algorithm satisfies MUTEX liveness already under the assumption of fairness of actions. We demonstrate an interesting correspondence between liveness and the catastrophic cycles that we introduced before when studying the performance of pipelining. Finally, our previous result on the correspondence between timing and fairness scales up to the extended language.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Flavio Corradini, Mariarita R. Di Berardini, Walter VoglerGND
URN:urn:nbn:de:bvb:384-opus4-9756
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/1126
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2008-13)
Type:Report
Language:English
Publishing Institution:Universität Augsburg
Contributing Corporation:Dipartimento di Matematica e Informatica Universià di Camerino
Release Date:2008/07/23
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