46 research outputs found

    Nonsequential Automata Semantics for a Concurrent, Ob ject-Based Language

    No full text
    cfl1998 Published by Elsevier Science B. V. Menezes, Sernadas & Costa 1 Introduction We construct a semantic domain with full concurrency which satisfies the diagonal compositionality requirement, i.e., reifications compose (vertically), reflecting the stepwise description of systems, involving several levels of abstraction, and distributes through combinators (horizontally), meaning that the reification of a composite system is the composition of the reification of its parts
    corecore