Fairness of Actions in System Computations
- 39 Downloads
This paper contrasts two important features of parallel system computations: fairness and timing. The study is carried out at a 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 Costa and Stirling (Acta Inf. 21:417–441, 1984) and in Costa and Stirling (Inf. Comput. 73:207–244, 1987)], and with upper time bounds for the process activities (as in Corradini et al. Acta Inf. 38:735–792, 2002). 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.
KeywordsInduction Hypothesis Operational Semantic System Computation Operational Rule Execution Sequence
Unable to display preview. Download preview PDF.
- 1.Bihler E., Vogler W. Efficiency of token-passing MUTEX-solutions— some experiments. In: Desel, J. et al. (eds.) Applications and Theory of Petri Nets 1998, Lect. Notes Comp. Sci. 1420, pp. 185–204, Springer, Berlin Heidelberg New York (1998)Google Scholar
- 2.Brookes, S. Traces, pomsets, fairness and full abstractions for communicating processes. In: Concur’02, Lect. Notes Comp. Sci. 2421, pp 466-482. Springer, Berlin Heidelberg New York (2002)Google Scholar
- 3.Corradini, F., Di Berardini, M.R., Vogler, W. PAFAS at work: comparing the worst-case efficiency of three buffer implementations. In: Proceedings of 2nd Asia-Pacific Conference on Quality Software, APAQS 2001, pp. 231–240, IEEE, Los Alamitos (2001)Google Scholar
- 4.Corradini, F., Di BerardiniM, M.R., Vogler, W. Relating fairness and timing in process algebras. In: Concur’03, Lect. Notes Comp. Sci. 2761, pp. 446–460. Springer, Berlin Heidelberg New York (2003)Google Scholar
- 5.Corradini, F., Di Berardini, M.R.., Vogler, W. Fairness of components in system computations. In: Proceedins of 11th International Workshop on Expressiveness in Concurrency, Express’04, London, August 2004. A full version of this paper with the same title appeared as Technical Report 2005-3, at http://www.informatik.uni-augsburg.de/skripts/techreportsGoogle Scholar
- 11.Jenner, L., Vogler, W. Comparing the efficiency of asynchronous systems. In: Proceedings of AMAST Workshop on Real-Time and Probabilistic Systems, LNCS 1601, pp 172–191 (1999). Modified full version as Google Scholar
- 15.Vogler, W. Efficiency of asynchronous systems and read arcs in petri nets. In: Icalp’97, Lect. Notes Comp. Sci. 1256, pp. 538–548, Springer, Berlin Heidelberg New York (1997)Google Scholar
- 17.Vogler, W. Modular construction and partial order semantics of petri nets. Lect. Notes Comp. Sci. 625, Springer, Berlin Heidelberg New York (1992)Google Scholar