Abstract
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.
Cite
CITATION STYLE
Moszkowski, B. (1985). A temporal analysis of some concurrent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 207 LNCS, pp. 359–364). Springer Verlag. https://doi.org/10.1007/3-540-16047-7_58
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
