Calculi for interaction

DOI10.1007/S002360050067zbMath0853.68123OpenAlexW4246926559MaRDI QIDQ1901716

Arthur J. Milner

Publication date: 15 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050067

zbMATH Keywords

Petri netstyped lambda calculusinteractive computationterm algebrapi calculusaction calculi

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (19)

A generic type system for the pi-calculus ⋮ Unnamed Item ⋮ Variations on mobile processes ⋮ Two-dimensional linear algebra ⋮ Pseudo-commutative Monads ⋮ Pure bigraphs: structure and dynamics ⋮ Locating reaction with 2-categories ⋮ A brief history of process algebra ⋮ From rewrite rules to bisimulation congruences ⋮ Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators ⋮ Dynamical systems and sheaves ⋮ A categorical framework for typing CCS-style process communication ⋮ Deriving Bisimulation Congruences: A 2-categorical Approach ⋮ Explicit fusions ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Normal forms for algebras of connections. ⋮ Bigraphs and Their Algebra ⋮ Dynamic connectors for concurrency ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

This page was built for publication: Calculi for interaction