Skip to Main content Skip to Navigation

Synchronous Machines: a Traced Category

Abstract : Synchronous programming languages have been extensively used in the area of critical embedded systems. Synchronous machines, a specific class of labelled transition systems, are often used to give denotational semantics of these languages. In this work, we study the categorical structure of the aforementioned machines. We first show that the category S of synchronous machines can be given a traced symmetric monoidal structure with diagonals. Then, we apply a standard variant of the Int construction to S and relate the composition in the resulting category with the synchronous product, the operation used to model parallel composition of synchronous programs. We also show how properties of synchronous machines like determinism and reactivity relate to the way they compose with diagonal morphisms of S.
Document type :
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Marc Bagnol Connect in order to contact the contributor
Submitted on : Tuesday, November 27, 2012 - 4:49:19 PM
Last modification on : Monday, January 10, 2022 - 5:30:04 PM
Long-term archiving on: : Saturday, December 17, 2016 - 4:29:58 PM


Files produced by the author(s)


  • HAL Id : hal-00748010, version 3



Marc Bagnol, Guatto Adrien. Synchronous Machines: a Traced Category. [Research Report] 2012. ⟨hal-00748010v3⟩



Les métriques sont temporairement indisponibles