Abstract
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairness, liveness and the timing of systems, using as application Dekker’s mutual exclusion algorithm we already considered in [4]. 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 in [6] when studying the performance of pipelining. Finally, our previous result on the correspondence between timing and fairness [4] scales up to the extended language.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bouyer, P., Haddad, S., Reynier, P.A.: Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 420–431. Springer, Heidelberg (2006)
Christensen, S., Hansen, N.D.: Coloured Petri nets extended with place capacities, test arcs, and inhibitor arcs. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 186–205. Springer, Heidelberg (1993)
Corradini, F., Di Berardini, M.R., Vogler, W.: Checking a Mutex Algorithm in a Process Algebra with Fairness. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 142–157. Springer, Heidelberg (2006)
Corradini, F., Di Berardini, M.R., Vogler, W.: Fairness of Actions in System Computations. Acta Informatica 43, 73–130 (2006)
Corradini, F., Di Berardini, M.R., Vogler, W.: Time and Fairness in a Process Algebra with Non-Blocking Reading. Technical Report 2008-13, Institute of Computer Science, University of Augsburg (2008)
Corradini, F., Vogler, W.: Measuring the Performance of Asynchronous Systems with PAFAS. Theoretical Computer Science 335, 187–213 (2005)
Corradini, F., Vogler, W., Jenner, L.: Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS. Acta Informatica 38, 735–792 (2002)
Costa, G., Stirling, C.: Weak and Strong Fairness in CCS. Information and Computation 73, 207–244 (1987)
Crazzolara, F., Winskel, G.: Events in security protocols. In: Proc. of 8th ACM conference on Computer and Communication Security, CCS 2001, pp. 96–105 (2001)
Milner, R.: Communication and Concurrency. International series in computer science, Prentice Hall International (1989)
Montanari, U., Rossi, F.: Contextual net. Acta Informatica 32, 545–596 (1995)
Montanari, U., Rossi, F.: Contextual occurrence nets and concurrent constraints programming. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol. 776, pp. 280–295. Springer, Heidelberg (1994)
Raynal, M.: Algorithms for Mutual Exclusion. North Oxford Academic (1986)
Ristori, G.: Modelling Systems with Shared Resources via Petri Nets. PhD thesis, Department of Computer Science, University of Pisa (1994)
Vogler, W.: Efficiency of Asynchronous Systems, Read Arcs and the MUTEX-problem. Theoretical Computer Science 275(1-2), 589–631 (2002)
Walker, D.J.: Automated Analysis of Mutual Exclusion algorithms using CCS. Formal Aspects of Computing 1, 273–292 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, F., Di Berardini, M.R., Vogler, W. (2009). Time and Fairness in a Process Algebra with Non-blocking Reading. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds) SOFSEM 2009: Theory and Practice of Computer Science. SOFSEM 2009. Lecture Notes in Computer Science, vol 5404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95891-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-95891-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95890-1
Online ISBN: 978-3-540-95891-8
eBook Packages: Computer ScienceComputer Science (R0)