Consider the generalized controller design problem in Figure 1 where P denotes the generalized plant model. Here, the objective is to design the controller K, which, based on the sensed outputs v, computes the inputs (MVs) u such that the variables z are kept small, in spite of variations in the variables w, which include disturbances (d), varying setpoints/references (CVs) and measurement nois...

Syntax Semantic Functions (needs: Abstract Syntax, Semantic Entities.) ADA abstractions, 2. AN ILLUSTRATIVE EXAMPLE

Application-level message passing is supported by many concurrent programming languages. Such languages allow messages to be generated by invoking an entry. Messages are removed from an entry by an invocation selection mechanism. Such mechanisms may allow selection from a set of entries (multi-way receive). Many concurrent languages provide support for multi-way receives, but they are limited i...

It is meaningful that a language is provided with several semantic descriptions: e.g. one which serves the needs of the implementor, another one that is suitable for specification and yet another one that will be used to explain the language to the user. In this case one has to guarantee that the various semantics are 'consistent' . The attempt of this paper is to clarify the notion 'consistenc...

The category of 1-bounded compact ultrametric spaces and non-distance increasing functions (KUM's) have been extensively used in the semantics of concurrent programming languages. In this paper a universal space U for KUM's is introduced, such that each KUM can be isomet-rically embedded in it. U consists of a suitable subset of the space of functions from 0; 1) to IN, endowed with a \preex-bas...

Aspect-Oriented Programming (AOP) promises the modularization of so-called crosscutting functionalities in large applications. Currently, almost all approaches to AOP provide means for the description of sequential aspects that are to be applied to a sequential base program. In particular, there is no formally-defined concurrent approach to AOP, with the result that coordination issues between ...

We address the problem of identifying connuent parts of concurrent constraint programs. The connuence property guarantees that a concurrent program will always compute the same result independent of the execution strategy. In this paper, we introduce a simple test for connuence based on work in rewrite systems. Furthermore, we show how to use this test to certify the combination of concurrent c...