Calculi for interaction
Action structures have previously been proposed as an algebra for both the syntax and the semantics of interactive computation. Here, a class of concrete action structures called action calculi is identified, which can serve as a non-linear syntax for a wide variety of models of interactive behaviour. Each action in an action calculus is represented as an assembly of molecules; the syntactic binding of names is the means by which molecules are bound together. A graphical form, action graphs, is used to aid presentation. One action calculus differs from another only in its generators, called controls. Action calculi generalise a previously defined action structure PIC for the pi calculus. Several extensions to PIC are given as action calculi, giving essentially the same power as the pi calculus. An action calculus is also given for the typed lambda calculus, and for Petri nets parametrized on their places and transitions. An equational characterization of action calculi is given: each action calculus \(A\) is the quotient of a term algebra by certain equations. The terms are generated by a set of operators, including those basic to all action structures as well as the controls specific to \(A\); the equations are the basic axioms of action structures together with four additional axiom schemata.
- Closed action calculi
- Dynamic connectors for concurrency
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Locating reaction with 2-categories
- A brief history of process algebra
- Normal forms for algebras of connections.
- Molecular interaction.
- A generic type system for the pi-calculus
- Variations on mobile processes
- Dynamical systems and sheaves
- Pure bigraphs: structure and dynamics
- Explicit fusions
- A categorical framework for typing CCS-style process communication
- Deriving bisimulation congruences: a 2-categorical approach
- Bigraphs and their algebra
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- scientific article; zbMATH DE number 1223613 (Why is no real title available?)
- scientific article; zbMATH DE number 1231458 (Why is no real title available?)
- scientific article; zbMATH DE number 1231609 (Why is no real title available?)
- scientific article; zbMATH DE number 1333606 (Why is no real title available?)
- scientific article; zbMATH DE number 1088052 (Why is no real title available?)
- Categorical logic of names and abstraction in action calculi
- scientific article; zbMATH DE number 1555188 (Why is no real title available?)
- scientific article; zbMATH DE number 1759603 (Why is no real title available?)
- scientific article; zbMATH DE number 1930740 (Why is no real title available?)
- scientific article; zbMATH DE number 785050 (Why is no real title available?)
- Two-dimensional linear algebra
- Pseudo-commutative monads
- scientific article; zbMATH DE number 7450001 (Why is no real title available?)
- Foundations of Software Science and Computational Structures
- From rewrite rules to bisimulation congruences
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
- Elementary control structures
- Shallow linear action graphs and their embeddings
- A thread calculus with molecular dynamics
This page was built for publication: Calculi for interaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901716)
