This paper shows the relation between linear temporal logic and theory of languages of concurrent processes. To this purpose, we give an algebraic correspondence between temporal logic systems and some non deterministic sequential machines. This correspondence lies on an effective method which composes machines as temporal operators. So we can synthetise processes from temporal logic formulas and solve logic problems by algorithms applied to machines.
CITATION STYLE
Michel, M. (1984). Algebre de machines et logique temporelle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 166 LNCS, pp. 287–298). Springer Verlag. https://doi.org/10.1007/3-540-12920-0_26
Mendeley helps you to discover research relevant for your work.