Publication

CO-OPN for specifying a distributed termination detection algorithm

Didier Buchs
1993
Conference Papers

Abstract

The SANDS environment along with the CO-OPN specification formalisms are presented. The latter permitting specification of data types and concurrency through the use of modular algebraic specifications and structured algebraic nets based upon an object oriented approach. System specification will be demonstrated through an ascending distributed termination detection algorithm. Major aspects of the environment and the CO-OPN formalism will be discussed.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Didier Buchs
1993
Conference Papers

Abstract

Official source

Related concepts (24)

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.

Algebraic data type

In computer programming, especially functional programming and type theory, an algebraic data type (ADT) is a kind of composite type, i.e., a type formed by combining other types. Two common classes of algebraic types are product types (i.e., tuples and records) and sum types (i.e., tagged or disjoint unions, coproduct types or variant types). The values of a product type typically contain several values, called fields. All values of that type have the same combination of field types.

Recursive data type

In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs. An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to an arbitrarily large size in response to runtime requirements; in contrast, a static array's size requirements must be set at compile time.

Related publications (2)

CO-OPN for specifying a distributed termination detection algorithm

Chat with Graph Search

Triune Continuum Paradigm : a paradigm for general system modeling and its applications for UML and RM-ODP

Proposals for enhancement of the Ada programming language : a software engineering perspective