• Publications
  • Influence
Processes and the Denotational Semantics of Concurrency
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. The mathematical model introduces processes as elements of process domains which are obtained asExpand
Control flow semantics
Part 1 Fundamentals: recursion and iteration - recursion - transition systems and higher-order definitions, interation - a nonuniform language with continuation semantics, exercises, bibliographicalExpand
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
This work proposes a temporal logic for causality and choice in distributed systems based on bisimulation semantics for concurrency and describes a logic for distributed transition systems. Expand
On the Completeness of the Inductive Assertion Method
Manna's theorem on (partial) correctness of programs is extended to programs with (parameterless) recursion to provide a characterization of recursion which is an alternative to the minimal fixed point characterization, and to clarify the relationship between partial and total correctness. Expand
Fully Abstract Denotational Models for Nonuniform Concurrent Languages
This paper investigates full abstraction of denotational model w.r.t. operational ones for two concurrent languages. The languages are nonuniform in the sense that the meaning of atomic statementsExpand
Denotational Semantics of a Parallel Object-Oriented Language
A denotational model is presented for the language POOL, a parallel object-oriented language that is actually used to write programs for a parallel machine, and a new technique is developed to solve a wide class of such equations, including function space constructions. Expand
Denotational semantics of concurrency
A general framework for the denotational treatment of concurrency is introduced, using tools from metric topology as advocated by Nivat to solve this equation, and illustrating the approach with the definition of a variety of concepts as encountered in the study of concurrence. Expand
Topological Models for Higher Ordr Control Flow
Operational and denotational models are developed for two simple imperative languages with higher order constructs, and the semantic mappings are defined as fixed points of (contractive) higher order operators by Banach's theorem. Expand
Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings
An old-fashioned recipe for real time verifying automata specifications of probabilistic real-time systems and a specification of the cat and mouse problem. Expand