Quiescence, fairness, testing, and the notion of implementation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 715 LNCS, Issue , 1993, Pages 324-338

  Segala, Roberto ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INPUT/OUTPUT AUTOMATA; PREORDERS; TRANSITION SYSTEM;

AUTOMATA THEORY;

EID: 84979063077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57208-2_23     Document Type: Conference Paper

References (18)

1. S. Brookes, C. Hoare, and A. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560-599, 1984.
2. 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.
3. R. De Nicola. Testing Equivalences and Fully Abstract Models for Communicating Processes. PhD thesis, Department of Computer Science, University of Edinburgh, 1985.
4. R. De Nicola. Extensional equivalences for transition systems. Acta Informatica, 24:211-237, 1987.
5. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
6. D. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM Distinguished Dissertations. MIT Press, 1988.
7. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
8. C. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.
9. M. Josephs. Receptive process theory. Acta Informatica, 29:17-31, 1992.
10. 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.
11. 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.
12. 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.
13. 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.
14. 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.
15. R. Segala. A process algebraic view of I/O automata. Technical Report MIT/LCS/TR-557, Laboratory for Computer Science, MIT, October 1992.
16. 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.
17. 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.
18. 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.