A temporal analysis of some concurrent systems
In previous work, we presented interval temporal logic (ITL), a formal logic for reasoning about time. It was shown that ITL provides a way to view programming constructs for assignment, repetition and parallelism as logical operators. This paper demonstrates the applicability of ITL to some problems given in the STL concurrency workshop. These include a bidirectional channel, a railway and a message-routing network.
KeywordsConcurrent Program Array Processor Unit Delay Queue Delay Pass Transistor
Unable to display preview. Download preview PDF.
- J. Halpern, Z. Manna and B. Moszkowski. A hardware semantics based on temporal intervals. Proceedings of the 10-th International Colloquium on Automata, Languages and Programming, Barcelona, Spain, July, 1983.Google Scholar
- Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. S. Boyer and J. S. Moore, editors, The Correctness Problem in Computer Science, pages 215–273, Academic Press, New York, 1981.Google Scholar
- B. Moszkowski. Reasoning about Digital Circuits. PhD Thesis, Department of Computer Science, Stanford University, 1983.Google Scholar
- B. Moszkowski and Z. Manna. Reasoning in interval temporal logic. Dept. of Computer Science, Stanford University, Technical Report STAN-CS-83-969.Google Scholar
- B. Moszkowski and Z. Manna. Temporal logic as a programming language. To appear in the proceedings of Parallel Computing 83, West Berlin, Sept., 1983Google Scholar
- N. Rescher and A. Urquart. Temporal Logic. Springer-Verlag, New York, 1971.Google Scholar
- Problem set for the concurrency workshop. In these proceedings.Google Scholar