Abstract
Two different formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automata are encoded into the theory of testing and the reversed MUST preorder is shown to be equivalent to the quiescent preorder for strongly convergent, finitely branching automata up to encoding. Conversely, a theory of testing is defined directly on I/O automata, and the new reversed MUST preorder is shown to coincide with the quiescent preorder on strongly convergent, finitely branching automata. Finally, some considerations are given on the issue of divergence, and on other existing theories with an I/O distinction.
Supported by NSF grant CCR-89-15206, by DARPA contracts N00014-89-J-1988 and N00014-92-J-4033, and by ONR contract N00014-91-J-1046.
Chapter PDF
References
S. Brookes, C. Hoare, and A. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560–599, 1984.
S. Brookes and A. Roscoe. An improved failures model for communicating processes. In S. Brookes, A. Roscoe, and G. Winskel, editors, Seminar on Concurrency, LNCS 197, pages 281–305. Springer-Verlag, 1984.
R. De Nicola. Testing Equivalences and Fully Abstract Models for Communicating Processes. PhD thesis, Department of Computer Science, University of Edinburgh, 1985.
R. De Nicola. Extensional equivalences for transition systems. Acta Informatica, 24:211–237, 1987.
R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.
D. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM Distinguished Dissertations. MIT Press, 1988.
M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
C. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.
M. Josephs. Receptive process theory. Acta Informatica, 29:17–31, 1992.
B. Lampson, N. Lynch, and J. Søgaard-Andersen. Reliable at-most-once message delivery protocols. Tech. report under preparation, Laboratory for Computer Science, Massachusetts Institute Technology, 1993.
N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137–151, Vancouver, Canada, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.
N. Lynch and F. Vaandrager. Forward and backward simulations for timing-based systems. In J. de Bakker, C. Huizing, W. d. Roever, and G. Rozenberg, editors, Proceedings of the REX Workshop “Real-Time: Theory in Practice”, 600 of Lecture Notes in Computer Science, pages 397–446. Springer-Verlag, 1991.
D. Muller and W. Bartky. A theory of asynchronous circuits. Annals of the Computation Laboratory of Harvard University. Volume XXIX: Proceedings of an International Symposium on the Theory of Switching, Part I, pages 204–243, 1959.
N. Reingold, D. Wand, and L. Zuck. Games I/O automata play. In W. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, Volume 630 of Lecture Notes in Computer Science, pages 325–339. Springer-Verlag, 1992.
R. Segala. A process algebraic view of I/O automata. Technical Report MIT/LCS/TR-557, Laboratory for Computer Science, MIT, October 1992.
E. Stark. On the relations computable by a class of concurrent automata. In Proceedings of the 1990 SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1990.
F. Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science, 1991.
J. Welch, L. Lamport, and N. Lynch. A lattice-structured proof technique applied to a minimum spanning tree algorithm. Technical Report MIT/LCS/TM-361, Laboratory for Computer Science, MIT, June 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Segala, R. (1993). Quiescence, fairness, testing, and the notion of implementation. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive