Abstract
This paper contrasts two important features of parallel system computations: fairness and timing. The study is carried out at specification system level by resorting to a well-known process description language. The language is extended with labels which allow to filter out those process executions that are not (weakly) fair (as in [5,6]), and with upper time bounds for the process activities (as in [2]).
We show that fairness and timing are closely related. Two main results are stated. First, we show that each everlasting (or non-Zeno) timed process execution is fair. Second, we provide a characterization for fair executions of untimed processes in terms of timed process executions. This results in a finite representation of fair executions using regular expressions.
This work was supported by MURST project ‘Sahara: Software Architectures for Heterogeneous Access Networks infrastructures’ and by the Center of Eccellence for Research ‘DEWS: Architectures and Design Methodologies for Embedded Controllers, Wireless Interconnect and System-on-chip’.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brookes, S.: Traces, Pomsets, Fairness and Full Abstarctions for Communicating Processes. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 466–482. Springer, Heidelberg (2002)
Corradini, F., Vogler, W., Jenner, L.: Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS. Acta Informatica 38, 735–792 (2002)
Corradini, F., Di Berardini, M.R., Vogler, W.: PAFAS at work: Comparing the Worst-Case Efficiency of Three Buffer Implementations. In: Proc. of 2nd Asia- Pacific Conference on Quality Software, APAQS 2001, pp. 231–240. IEEE, Los Alamitos (2001)
Corradini, F., Di Berardini, M.R., Vogler, W.: Relating Fairness and Timing in Process Algebra. RR 03-2003, Univ. of L’Aquila (2003), Available from: http://www.di.univaq.it/flavio
Costa, G., Stirling, C.: A Fair Calculus of Communicating Systems. Acta Informatica 21, 417–441 (1984)
Costa, G., Stirling, C.: Weak and Strong Fairness in CCS. Information and Computation 73, 207–244 (1987)
De Nicola, R., Hennessy, M.C.B.: Testing equivalence for processes. Theoret. Comput. Sci. 34, 83–133 (1984)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Jenner, L., Vogler, W.: Comparing the Efficiency of Asynchronous Systems. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 172–191. Springer, Heidelberg (1999)
Jenner, L., Vogler, W.: Fast asynchronous systems in dense time. Theoret. Comput. Sci. 254, 379–422 (2001); Extended abstract in Meyer auf der Heide, F., Monien, B. (eds.): ICALP 1996. LNCS, vol. 1099. Springer, Heidelberg (1996)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Vogler, W.: Efficiency of asynchronous systems, read arcs, and the MUTEXproblem. Theoret. Comput. Sci. 275, 589–631 (2002)
Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, F., Di Berardini, M.R., Vogler, W. (2003). Relating Fairness and Timing in Process Algebras. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-45187-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40753-9
Online ISBN: 978-3-540-45187-7
eBook Packages: Springer Book Archive