Nonsequential Automata Semantics for a Concurrent, Object-Based Language
Paulo Blauth Menezes, Amı́lcar Sernadas, José Félix Costa · Electronic Notes in Theoretical Computer Science · 1998
Nonsequential automata constitute a categorial semantic domain based on labeled transition system with full concurrency, where restriction and relabeling are functorial and a class of morphisms stands for reification. It is a model for concurrency which satisfies the diagonal compositionality requirement, i.e., reifications compose (vertically) and distribute over combinators (horizontally). To experiment with the proposed semantic domain, a semantics for a concurrent, object-based language is given. It is a simplified and revised version of the object-oriented specification language GNOME, introducing some special features inspired by the semantic domain such as reification and aggregation. The diagonal compositionality is an essential property to give semantics in this context.