×
Kindler, Ekkart; Walter, Rolf

Mutex needs fairness. (English) Zbl 1336.68182

Inf. Process. Lett. 62, No. 1, 31-39 (1997).

Cited in 11 Documents

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q55 Semantics in the theory of computing

Keywords:

distributed system; mutual exclusion; fairness; progrees; partial-order semantics; Petri nets
Cite Review PDF
Full Text: DOI

References:

[1] Abadi, M.; Lamport, L., The existence of refinement mappings, Theoret. Comput. Sci., 82, 253-284 (1991) · Zbl 0728.68083
[2] Apt, K. R.; Francez, N.; Katz, S., Appraising fairness in languages for distributed programming, Distributed Comput., 2, 226-241 (1988) · Zbl 0659.68023
[3] Best, E., Fairness and conspiracies, Inform. Process. Lett., 18, 215-220 (1984) · Zbl 0558.68052
[4] Best, E., Semantik (1995), Vieweg: Vieweg Braunschweig · Zbl 0822.68058
[5] Best, E.; Fernández, C., Nonsequential Processes, (EATCS Monographs on Theoretical Computer Science, Vol. 13 (1988), Springer: Springer Berlin) · Zbl 0656.68005
[6] Burns, G.; Esparza, J., Trapping mutual exclusion in the box calculus, Theoret. Comput. Sci., 153, 95-128 (1996), (Special Volume on Petri Nets) · Zbl 0872.68133
[7] Desel, J.; Reisig, W.; Walter, R., The alternating bit protocol — fairness versus priority, Petri Net Newsletter, 35, 3-5 (1990)
[8] Dijkstra, E. W., Solution of a problem in concurrent programming control, Comm. ACM, 8, 9, 569 (1965)
[9] Dijkstra, E. W., Position paper on “fairness”, ACM SIGSOFT Software Engineering Notes, 13, 2, 18-20 (1988)
[10] Francez, N., Fairness, (Texts and Monographs in Computer Science (1986), Springer: Springer Berlin) · Zbl 0602.68007
[11] Goltz, U.; Reisig, W., The non-sequential behaviour of Petri nets, Inform. and Control, 57, 125-147 (1983) · Zbl 0551.68050
[12] Gomm, D.; Kindler, E.; Paech, B.; Walter, R., Compositional liveness properties of EN-systems, (Marsan, M. Ajmone, Applications and Theory of Petri Nets, Proc. 14th Internat. Conf.. Applications and Theory of Petri Nets, Proc. 14th Internat. Conf., Lecture Notes in Computer Science, Vol. 691 (1993), Springer: Springer Berlin), 262-281
[13] Kindler, E., (Ph.D. Thesis (1995), Technische Universität München)
[14] Kindler, E.; Walter, R., Message passing mutex, (Desel, J., Structures in Concurrency Theory, Workshops in Computing (1995), Springer: Springer Berlin), 205-291
[15] Kwiatkowska, M. Z., Event fairness and non-interleaving concurrency, Formal Aspects Comput., 1, 213-228 (1989) · Zbl 0696.68092
[16] Lehmann, D.; Pnueli, A.; Stavi, J., Impartiality, justice and fairness: The ethic of concurrent systems, (Even, S.; Kariv, O., Automata, Languages and Programming. Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 115 (1981), Springer: Springer Berlin), 264-277 · Zbl 0468.68026
[17] Manna, Z.; Pnueli, A., The Temporal Logic of Reactive and Concurrent Systems, Specification (1992), Springer: Springer Berlin
[18] Peterson, G. L., Myths about the mutual exclusion problem, Informat. Process. Lett., 12, 3, 115-116 (1981) · Zbl 0474.68031
[19] Reisig, W., Petri Nets, (EATCS Monographs on Theoretical Computer Science, Vol. 4 (1985), Springer: Springer Berlin) · Zbl 0521.68057
[20] Reisig, W., Das Verhalten verteilter Systeme, GMD-Bericht, 170 (1987)
[21] Schneider, F. B.; Lamport, L., Another position paper on “fairness”, ACM SIGSOFT Software Engineering Notes, 13, 3, 18-19 (1988)
[22] Smith, E., On the border of causality: Contact and confusion, Theoret. Comput. Sci., 153, 245-270 (1996) · Zbl 0872.68128
[23] Valk, R., On theory and practise: An exercise in fairness, Petri Net Newsletter, 26, 4-11 (1987)
[24] Vogler, W., Fairness and partial order semantics, Informat. Process. Lett., 55, 33-39 (1995) · Zbl 0875.68622
[25] Vogler, W., Efficiency of asynchronous systems and read arcs in Petri nets, (Tech. Rept. Nr. 352 (April 1996), Institut für Mathematik, Universität Augsburg) · Zbl 1401.68235
[26] Walter, R., Petrinetzmodelle verteilter Algorithmen — Intuition und Beweistechnik, (Ph.D. Thesis (1995), Institut für Informatik, Humboldt-Universität zu Berlin)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.