Preface, A formal specification of PARLOG, The meaning of specifications 11: Set-theoretic specification, Petri nets and automata with concurrency relations: An adjunction, Concurrent automata, prime event structures and universal domains, Synthesis of nondeterministic asynchronous automata, A cartesian closed category of parallel algorithms between Scott-domains, Observable modules and power domain constructions, The Smyth-completion of a quasi-uniform space, What is a state of a system? (An outline), Current trends in the semantics of data flow, Computing the canonical representation of a finite lattice, A theory of unary pairfunctions, A lattice interpretation of database dependencies, Semantics in an extended entity-relationship model, Index
