We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The calculus is an extension of the process algebra CCS, following work by Engberg and Nielsen, who added mobility to CCS while preserving its algebraic properties. The rr-calculus gains simplicity by removing all distinction between variables and constants; communication links are identified by names, and computation is represented purely as the communication of names across links. After an illustrated description of how the n-calculus generalises conventional process algebras in treating mobility, several examples exploiting mobility are given in some detail. The important examples are the encoding into the n-calculus of higher-order functions (the I-calculus and combinatory algebra), the transmission of processes as values, and the representation of data structures as processes. The paper continues by presenting the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions-i.e., assumptions of inequality among names. These theories are based upon a semantics in terms of a labeled transition system and a notion of strong bisimulation, both of which are expounded in detail in a companion paper. We also report briefly on work-in-progress based upon the corresponding notion of weak bisimulation, in which internal actions cannot be observed. 0 1992 Academic Press, Inc.

A calculus of mobile processes, II

An Introduction to MultiAgent Systems.

From the Publisher:
Since the introduction of Hoares' Communicating Sequential Processes notation, powerful new tools have transformed CSP into a practical way of describing industrial-sized problems. This book gives you the fundamental grasp of CSP concepts you'll need to take advantage of those tools.Part I provides a detailed foundation for working with CSP, using as little mathematics as possible. It introduces the ideas behind operational, denotational and algebraic models of CSP. Parts II and III go into greater detail about theory and practice. Topics include: parallel operators, hiding and renaming, piping and enslavement, buffers and communication, termination and sequencing, and semantic theory. Three detailed practical case studies are also presented.For anyone interested in modeling sequential processes.

/pdf/the-theory-and-practice-of-concurrency-1kzi2sg7cs.pdf

The Theory and Practice of Concurrency

Publisher Summary
This chapter focuses on rewrite systems, which are directed equations used to compute by repeatedly replacing sub-terms of a given formula with equal terms until the simplest form possible is obtained. As a formalism, rewrite systems have the full power of Turing machines and may be thought of as nondeterministic Markov algorithms over terms rather than strings. The theory of rewriting is in essence a theory of normal forms. To some extent, it is an outgrowth of the study of A. Church's Lambda Calculus and H. B. Curry's Combinatory Logic. The chapter discusses the syntax and semantics of equations from the algebraic, logical, and operational points of view. To use a rewrite system as a decision procedure, it must be convergent. The chapter describes this fundamental concept as an abstract property of binary relations. To use a rewrite system for computation or as a decision procedure for validity of identities, the termination property is crucial. The chapter presents the basic methods for proving termination. The chapter discusses the question of satisfiability of equations and the convergence property applied to rewriting.

CHAPTER 6 – Rewrite Systems

We survey the literature available on the topic of domain-specific languages as used for the construction and maintenance of software systems. We list a selection of 75 key publications in the area, and provide a summary for each of the papers. Moreover, we discuss terminology, risks and benefits, example domain-specific languages, design methodologies, and implementation techniques.

https://people.cis.ksu.edu/~schmidt/505f14/Lectures/DSLbib.pdf

Domain-specific languages: an annotated bibliography

We investigate the expressiveness of backward jumps in a framework of formalized sequential programming called program algebra. We show that - if expressiveness is measured in terms of the computability of partial Boolean functions - then backward jumps are superfluous. If we, however, want to prevent explosion of the length of programs, then backward jumps are essential.

On the contribution of backward jumps to instruction sequence expressiveness

An alignment is developed between the terminology of outcome oriented decision taking and a terminology for promise issuing. Differences and correspondences are investigated between the concepts of decision and promise. For decision taking, two forms are distinguished: the external outcome delivering form and internalized decision taking. Internalized decision taking is brought in connection with Marc Slors' theory of self-programming. Examples are produced for decisions and promises in four different several settings each connected with software technology: instruction sequence effectuation, informational money transfer, budget announcement, and division by zero.

/pdf/decision-taking-versus-promise-issuing-23kq067j8t.pdf

Decision Taking versus Promise Issuing

We propose a first-order predicate logic TFL of timed frames extended
with signals. This logic combines a simple syntax with a high expressivity;
it can distinguish frames that are not the same as sets of transitions and
states. We show how Dicky logic and CTL can be embedded in TFL.

/pdf/a-logic-for-signal-inserted-timed-frames-39llfmkok6.pdf

A logic for signal inserted timed frames

In the setting of outcome oriented decision taking (OODT), decisions are scarce events occurring in between of many other events which are not decisions. Activities of and agency by an agent may occur without any decisions being taken by that agent, with choice and action determination as the only mechanisms for actively resolving uncertainty about future behavior. Such behaviour will be referred to as decision taking avoiding agency. A model, or rather a preliminary qualitative description, of decision taking avoiding agency is provided for systems consisting of or controlled by a solitary natural or artificial agent, as well as for a group of agents.

/pdf/decision-taking-avoiding-agency-49u64z4zww.pdf

Decision Taking Avoiding Agency

Many public controversies involve the assessment of statements about which we have imperfect information. Without a structured approach, it is quite difficult to develop an approach to reasoning which is not based on ad hoc choices. Forms of logic have been used in the past to try to bring such clarity, but these fail for a variety of reasons. We demonstrate a simple approach to bringing a standardized approach to semantics, in certain discourse, using Promise Theory. As a case, we use Promise Theory (PT) to collect and structure publicly available information about the case of the MCAS software component for the Boeing 737 Max flight control system.

Jan A. Bergstra

Papers

On the contribution of backward jumps to instruction sequence expressiveness

Decision Taking versus Promise Issuing

A logic for signal inserted timed frames

Decision Taking Avoiding Agency

A Promise Theoretic Account of the Boeing 737 Max MCAS Algorithm Affair