This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Martin Abadi, Leslie Lamport, and Pierre Wolper. Realizable and Unrealizable Specifications of Reactive Systems. In Proceedings of the 16th International Colloquium on Automata, Languages, and Programming. Springer-Verlag, 1989.
Mark Bennett. Proving Correctness of Asynchronous Circuits Using Temporal Logic. PhD thesis, University of California, Los Angeles, 1986.
David L. Black. On the existence of delay-insensitive fair arbiters: Trace theory and its limitations. Distributed Computing, 1(4):205–225, 1986.
J. Richard Büchiand Lawrence H. Landweber. Solving Sequential Conditions by Finite-state Strategies. Transactions of the American Mathematical Society, 138:295–311, April 1969.
Yaacov Choueka. Theories of Automata on ω-Tapes: A Simplified Approach. Journal of Computer and System Sciences, 8(2):117–141, April 1974.
Alonzo Church. Logic, Arithmetic, and Automata, pages 23–35. Institut Mittag-Leffler, 1963.
David L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. In Jonathan Allen and F. Thomson Leighton, editor, Advanced Research in VLSI: Proceedings of the Fifth MIT Conference. MIT Press, 1988.
David L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.
David L. Dill and Edmund M. Clarke. Automatic Verification of Asynchronous Circuits Using Temporal Logic. IEEE Proceedings, Pt. E, 133(5):276–282, September 1986.
Samuel Eilenberg. Automata, Languages, and Machines, Vol. A. Academic Press, 1974.
C.A.R. Hoare. A Model for Communicating Sequential Processes. Technical Report PRG-22, Programming Research Group, Oxford University Computing Laboratory, 1981.
Kevin S. Van Horn. An Approach to Concurrent Semantics Using Complete Traces. Technical Report Technical Report 5236:TR:86, Computer Science Department, California Institute of Technology, 1986.
Robin Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
Amir Pnueli. In Transition from Global to Modular Temporal Reasoning about Programs. In Kzysztof Apt, editor, Logics and Models of Concurrent Systems, volume 13 of NATO ASI Series F: Computer and System Sciences, pages 123–144. Springer-Verlag, 1985.
Amir Pnueli and Roni Rosner. On the Synthesis of a Reactive Module. In 16th ACM Symposium on Principles of Programming Languages, pages 179–190. ACM, 1989.
Amir Pnueli and Roni Rosner. On the Synthesis of an Asynchronous Reactive Module. In Proceedings of the 16th International Colloquium on Automata, Languages, and Programming. Springer-Verlag, 1989.
Michael O. Rabin. Automata on Infinite Objects and Church's Problem, volume 13 of Regional Conference Series in Mathematics. American Mathematical Society, 1972.
Martin Rem, Jan L.A. van de Snepscheut, and Jan Tijmen Udding. Trace Theory and the Definition of Hierarchical Components. In Randal Bryant, editor, Third CalTech Conference on Very Large Scale Integration, pages 225–239. Computer Science Press, Inc., 1983.
Shmuel Safra. On the Complexity of ω-Automata. In 29th IEEE Symposium on Foundations of Computer Science, pages 319–327. IEEE, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dill, D.L. (1990). Complete trace structures. In: Leeser, M., Brown, G. (eds) Hardware Specification, Verification and Synthesis: Mathematical Aspects. Lecture Notes in Computer Science, vol 408. Springer, New York, NY. https://doi.org/10.1007/0-387-97226-9_31
Download citation
DOI: https://doi.org/10.1007/0-387-97226-9_31
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97226-8
Online ISBN: 978-0-387-34801-8
eBook Packages: Springer Book Archive